# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
511565 |
2022-01-16T02:23:00 Z |
79brue |
None (JOI16_memory2) |
C++14 |
|
1 ms |
300 KB |
#include "Memory2_lib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
vector<int> ans[102];
void Solve(int T, int N){
n = N;
for(int i=0; i<n+n; i++){
int ret = 0;
for(int j=0; j<n+n; j++){
if(i!=j) ret = max(ret, Flip(i, j));
}
ans[ret].push_back(i);
}
for(int i=0; i<n; i++) Answer(ans[i][0], ans[i][1], i);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
296 KB |
Output is correct |
8 |
Correct |
0 ms |
300 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Wrong Answer[2] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Wrong Answer[2] |
2 |
Halted |
0 ms |
0 KB |
- |