# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
232965 |
2020-05-18T19:31:10 Z |
cfalas |
ICC (CEOI16_icc) |
C++14 |
|
480 ms |
900 KB |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID (l+r)/2
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef vector<int> vi;
#include "icc.h"
bool used[100000];
int adj[1000][1000];
void run(int n){
cout<<n<<endl;
for(int i=0;i<n-1;i++){
vi t;
for(int j=0;j<n;j++){
//if(used[j+1]) continue;
int a[1] = {j+1};
int b[n-1];
int cnt=0;
for(int k=0;k<n;k++) if(k!=j && !adj[j+1][k+1]) b[cnt++]=k+1;
if(query(1, cnt, a, b)){
cout<<"f";
t.push_back(j+1);
}
cout<<endl;
}
adj[t[1]][t[0]] = true;
adj[t[0]][t[1]] = true;
used[t[0]] = true;
used[t[1]] = true;
setRoad(t[0], t[1]);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
19 ms |
640 KB |
Program is not terminated properly. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
25 ms |
596 KB |
Program is not terminated properly. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
480 ms |
900 KB |
Program is not terminated properly. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
83 ms |
512 KB |
Program is not terminated properly. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
59 ms |
512 KB |
Program is not terminated properly. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
349 ms |
768 KB |
Program is not terminated properly. |
2 |
Halted |
0 ms |
0 KB |
- |