# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
501047 |
2022-01-02T09:44:26 Z |
600Mihnea |
Miners (IOI07_miners) |
C++17 |
|
46 ms |
588 KB |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0); cin.tie(0);
/// freopen ("input", "r", stdin);
int n;
string s;
cin >> n >> s;
function<int(deque<int>)> eval = [&] (deque<int> d) {
set<int> F;
for (auto &x : d) {
F.insert(x);
}
return (int) F.size();
};
function<int(deque<int>, int)> when = [&] (deque<int> d, int x) {
while ((int) d.size() < 2) d.push_front(-1);
assert((int) d.size() == 2);
if (d[0] == x && d[1] == x) return 10;
if (d[1] == x) return 2;
if (d[0] == x) return 1;
return -1;
};
int sol = 0;
deque<int> a, b;
for (int i = 1; i <= n; i++) {
if ((int) a.size() == 3) a.pop_front();
if ((int) b.size() == 3) b.pop_front();
int x = s[i - 1];
if (when(a, x) < when(b, x)) {
a.push_back(x);
sol += eval(a);
} else {
b.push_back(x);
sol += eval(b);
}
}
cout << sol << "\n";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
308 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
316 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
3 ms |
204 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
316 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
12 ms |
332 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
31 ms |
452 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
46 ms |
588 KB |
Output isn't correct |