#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define time first
#define ai second.first
#define bi second.second
int main() {
int n;
cin >> n;
vector<pair<int, pii>> l (n);
for(int i = 0; i < n; i++) {
cin >> l[i].time >> l[i].ai >> l[i].bi;
}
int le = 0, ri = 0, e = 0, b = 0;
bool found = false;
if (n == 1) {
if (l[ri].ai > 4) {
b += 100;
} else {
e += 100;
}
cout << e << " " << b;
return 0;
}
while (ri < n) {
if (le == ri) {
ri++;
if (l[ri].ai > 4) {
b += 100;
} else {
e += 100;
}
}
if (l[ri].time - l[le].time <= 10) {
for (int i = 1; i <= ri - le; i++) {
if (l[ri].ai == l[ri-i].ai) {
if (l[ri].ai > 4) {
b += 150;
found = true;
break;
} else {
e += 150;
found = true;
break;
}
}
}
if (found == false) {
if (l[ri].ai > 4) {
b += 100;
} else {
e += 100;
}
}
} else {
le++;
continue;
}
found = false;
ri++;
}
cout << e << " " << b;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
504 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
504 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |