# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
199723 |
2020-02-03T01:58:41 Z |
sean617 |
None (JOI16_memory2) |
C++ |
|
5 ms |
256 KB |
#include "Memory2_lib.h"
#include<vector>
using namespace std;
int n, mx[105];
vector<int> ans[105];
void Solve(int T, int N) {
int i, j, t;
n = N * 2;
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
t = Flip(i, j);
mx[i] = max(mx[i], t);
mx[j] = max(mx[j], t);
}
}
for (i = 0; i < n; i++) {
ans[mx[i]].push_back(i);
}
for (i =0; i < N; i++) {
Answer(ans[i][0], ans[i][1], i);
}
return;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
Output is correct |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Correct |
5 ms |
256 KB |
Output is correct |
4 |
Correct |
5 ms |
256 KB |
Output is correct |
5 |
Correct |
5 ms |
256 KB |
Output is correct |
6 |
Correct |
5 ms |
256 KB |
Output is correct |
7 |
Correct |
5 ms |
256 KB |
Output is correct |
8 |
Correct |
5 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
Wrong Answer[2] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
Wrong Answer[2] |
2 |
Halted |
0 ms |
0 KB |
- |