| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 65416 |
2018-08-07T14:29:16 Z |
boook |
Cave (IOI13_cave) |
C++14 |
|
1374 ms |
560 KB |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define REP(i,j,k) for(int i = j ; i < k ; ++i)
#define RREP(i,j,k) for(int i = j ; i >=k ; --i)
#define A first
#define B second
#define mp make_pair
#define pb emplace_back
#define PII pair<int , int>
#define MEM(i,j) memset(i , j , sizeof i)
#define ALL(i) i.begin() , i.end()
#define DBGG(i,j) cout << i << " " << j << endl
#define DB4(i,j,k,l) cout << i << " " << j << " " << k << " " << l << endl
#define IOS cin.tie(0) , cout.sync_with_stdio(0)
#define endl "\n"
///------------------------------------------------------------
#include "cave.h"
#define MAX
#define INF 0x3f3f3f3f
int nn , mah[5000] , ans[5000] , base[5000] , val[5000] , use[5050] , pre;
int query(int x[]){
int ans = tryCombination(x);
if(ans == -1) return nn + 1;
else return ans;
}
void exploreCave(int n){
nn = n;
REP(i , 0 , n){
pre = query(base);
// REP(i , 0 , n) cout << base[i] << " "; cout << endl;
// DBGG("pre = " , pre);
int can = -1;
RREP(j , 13 , 0){
int to = can + (1 << j) , cnt = 0;
REP(ii , 0 , n) val[ii] = base[ii];
REP(ii , 0 , n) if(cnt < to && use[ii] == 0){
cnt ++;
val[ii] = base[ii] ^ 1;
}
// if(cnt == to){
// cout << "now to = " << to << " ->";
// REP(ii , 0 , n) cout << val[ii] << " "; cout << endl;
// DBGG("get = " , query(val));
// }
if(cnt == to && (query(val) > i) == (pre > i)) can = to;
}
while(use[can] == 1) can ++;
// DBGG("can = " , can);
use[can] = 1;
ans[can] = pre > i ? base[can] : 1 - base[can];
mah[can] = i;
base[can] = ans[can];
// REP(i , 0 , n) cout << base[i] << " "; cout << endl;
// if(i == 1)
// break;
}
answer(ans , mah);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1093 ms |
492 KB |
Output is correct |
| 2 |
Correct |
533 ms |
516 KB |
Output is correct |
| 3 |
Correct |
759 ms |
516 KB |
Output is correct |
| 4 |
Correct |
622 ms |
516 KB |
Output is correct |
| 5 |
Correct |
915 ms |
520 KB |
Output is correct |
| 6 |
Correct |
885 ms |
512 KB |
Output is correct |
| 7 |
Correct |
799 ms |
516 KB |
Output is correct |
| 8 |
Correct |
5 ms |
512 KB |
Output is correct |
| 9 |
Correct |
5 ms |
512 KB |
Output is correct |
| 10 |
Correct |
5 ms |
512 KB |
Output is correct |
| 11 |
Correct |
5 ms |
384 KB |
Output is correct |
| 12 |
Correct |
1127 ms |
504 KB |
Output is correct |
| 13 |
Correct |
830 ms |
520 KB |
Output is correct |
| 14 |
Correct |
1374 ms |
524 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
927 ms |
504 KB |
Output is correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Incorrect |
910 ms |
560 KB |
Answer is wrong |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Correct |
6 ms |
324 KB |
Output is correct |
| 4 |
Correct |
5 ms |
384 KB |
Output is correct |
| 5 |
Correct |
7 ms |
384 KB |
Output is correct |
| 6 |
Correct |
6 ms |
384 KB |
Output is correct |
| 7 |
Incorrect |
6 ms |
512 KB |
Answer is wrong |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Correct |
6 ms |
324 KB |
Output is correct |
| 4 |
Correct |
5 ms |
384 KB |
Output is correct |
| 5 |
Correct |
7 ms |
384 KB |
Output is correct |
| 6 |
Correct |
6 ms |
384 KB |
Output is correct |
| 7 |
Incorrect |
6 ms |
512 KB |
Answer is wrong |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1093 ms |
492 KB |
Output is correct |
| 2 |
Correct |
533 ms |
516 KB |
Output is correct |
| 3 |
Correct |
759 ms |
516 KB |
Output is correct |
| 4 |
Correct |
622 ms |
516 KB |
Output is correct |
| 5 |
Correct |
915 ms |
520 KB |
Output is correct |
| 6 |
Correct |
885 ms |
512 KB |
Output is correct |
| 7 |
Correct |
799 ms |
516 KB |
Output is correct |
| 8 |
Correct |
5 ms |
512 KB |
Output is correct |
| 9 |
Correct |
5 ms |
512 KB |
Output is correct |
| 10 |
Correct |
5 ms |
512 KB |
Output is correct |
| 11 |
Correct |
5 ms |
384 KB |
Output is correct |
| 12 |
Correct |
1127 ms |
504 KB |
Output is correct |
| 13 |
Correct |
830 ms |
520 KB |
Output is correct |
| 14 |
Correct |
1374 ms |
524 KB |
Output is correct |
| 15 |
Correct |
927 ms |
504 KB |
Output is correct |
| 16 |
Correct |
5 ms |
384 KB |
Output is correct |
| 17 |
Incorrect |
910 ms |
560 KB |
Answer is wrong |
| 18 |
Halted |
0 ms |
0 KB |
- |
