| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 951325 |
2024-03-21T15:40:47 Z |
quanlt206 |
Cave (IOI13_cave) |
C++17 |
|
15 ms |
860 KB |
#include "cave.h"
#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;
template<class A, class B>
bool maximize(A& x, B y) {
if (x < y) return x = y, true; else return false;
}
template<class A, class B>
bool minimize(A& x, B y) {
if (x > y) return x = y, true; else return false;
}
/* END OF TEMPLATE */
const int N = 5e3 + 7;
int n, s[N], d[N];
int a[N], b[N];
void subtask_1() {
REP(i, 0, n) a[i] = i, b[i] = 0;
REP(i, 0, n) {
int val = tryCombination(b);
if (val > i || val == -1) continue;
b[i]^=1;
}
answer(b, a);
}
void exploreCave(int N) {
n = N;
subtask_1();
return ;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
344 KB |
Output is correct |
| 2 |
Correct |
5 ms |
348 KB |
Output is correct |
| 3 |
Correct |
8 ms |
348 KB |
Output is correct |
| 4 |
Correct |
6 ms |
348 KB |
Output is correct |
| 5 |
Correct |
14 ms |
348 KB |
Output is correct |
| 6 |
Correct |
8 ms |
348 KB |
Output is correct |
| 7 |
Correct |
14 ms |
508 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
9 ms |
860 KB |
Output is correct |
| 13 |
Correct |
8 ms |
568 KB |
Output is correct |
| 14 |
Correct |
8 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Incorrect |
14 ms |
348 KB |
Answer is wrong |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
440 KB |
Output is correct |
| 3 |
Incorrect |
0 ms |
348 KB |
Answer is wrong |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
440 KB |
Output is correct |
| 3 |
Incorrect |
0 ms |
348 KB |
Answer is wrong |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
344 KB |
Output is correct |
| 2 |
Correct |
5 ms |
348 KB |
Output is correct |
| 3 |
Correct |
8 ms |
348 KB |
Output is correct |
| 4 |
Correct |
6 ms |
348 KB |
Output is correct |
| 5 |
Correct |
14 ms |
348 KB |
Output is correct |
| 6 |
Correct |
8 ms |
348 KB |
Output is correct |
| 7 |
Correct |
14 ms |
508 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
9 ms |
860 KB |
Output is correct |
| 13 |
Correct |
8 ms |
568 KB |
Output is correct |
| 14 |
Correct |
8 ms |
348 KB |
Output is correct |
| 15 |
Correct |
15 ms |
348 KB |
Output is correct |
| 16 |
Correct |
0 ms |
348 KB |
Output is correct |
| 17 |
Incorrect |
14 ms |
348 KB |
Answer is wrong |
| 18 |
Halted |
0 ms |
0 KB |
- |
