-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtempo.cpp
85 lines (55 loc) · 1.56 KB
/
tempo.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include <bits/stdc++.h>
using namespace std;
string S;
int tempo[200];
int main (){
vector< pair <int, int> > resp;
int N, A[200],amigo;
char a;
cin>>N;
for(int i=0; i<N; i++){
cin>>a>>amigo;
A[i]=amigo;
S+=a;
}
int aux=0;
for(int i=0; i<N; i++){
if(S[i]=='R'){
aux=1;
if(i==(N-1))
resp.push_back(make_pair(A[i], -1));
for(int j=i+1; j<N; j++){
if(j==(N-1) and A[j]!=A[i]){
resp.push_back(make_pair(A[i], -1));
}
if(S[j]=='R' and aux==0)
aux=1;
else if(S[j]=='R' and aux==1)
tempo[A[i]]+=1;
if(S[j]=='E' and aux==0)
aux=1;
else if(S[j]=='E' and aux==1)
tempo[A[i]]+=1;
if(S[j]=='E' and A[j]==A[i]){
resp.push_back(make_pair(A[i], tempo[A[i]]));
break;
}
if(S[j]=='T'){
tempo[A[i]]+=A[j];
aux=0;
}
}
}
}
sort(resp.begin(), resp.end());
int agoravai=0;
for(int i=0; i<resp.size(); i++){
if(resp[i].second==-1){
cout << resp[i].first << " "<< resp[i].second << endl;
agoravai=resp[i].first;
}
if(resp[i].first==resp[i+1].first) continue;
if(agoravai!=resp[i].first)
cout << resp[i].first << " "<< resp[i].second << endl;
}
}