Submission #172776

#TimeUsernameProblemLanguageResultExecution timeMemory
172776mohammadCave (IOI13_cave)C++14
13 / 100
24 ms472 KiB
/* ░░░░██████████████████ ░░▄███████▀▀▀▀▀▀███████▄ ░▐████▀▒mohammad▒▀██████▄ ░███▀▒▒▒▒alaa▒▒▒▒▒▒▀█████ ░▐██▒▒▒alwrawrah▒▒▒▒▒████▌ ░▐█▌▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒████▌ ░░█▒▄▀▀▀▀▀▄▒▒▄▀▀▀▀▀▄▒▐███▌ ░░░▐░░░▄▄░░▌▐░░░▄▄░░▌▐███▌ ░▄▀▌░░░▀▀░░▌▐░░░▀▀░░▌▒▀▒█▌ ░▌▒▀▄░░░░▄▀▒▒▀▄░░░▄▀▒▒▄▀▒▌ ░▀▄▐▒▀▀▀▀▒▒▒▒▒▒▀▀▀▒▒▒▒▒▒█ ░░░▀▌▒▄██▄▄▄▄████▄▒▒▒▒█▀ ░░░░▄██████████████▒▒▐▌ ░░░▀███▀▀████▀█████▀▒▌ ░░░░░▌▒▒▒▄▒▒▒▄▒▒▒▒▒▒▐ ░░░░░▌▒▒▒▒▀▀▀▒▒▒▒▒▒▒▐ */ #include<bits/stdc++.h> #include "cave.h" using namespace std; typedef long long ll ; const ll oo = 4294967296; const double PI = acos(-1); const ll M = 998244353; int s[5010] , d[5010]; void exploreCave(int N){ for(int i = 0 ; i < N ; ++i) d[i] = -1 , s[i] = 0; int x = tryCombination(s) , idx = 0; while(x != -1){ s[idx] = 1 ; int nx = tryCombination(s); if(x >= nx) s[idx] = 0; idx++; if(idx == N) idx = 0; } for(int i = 0 ; i < N ; ++i){ s[i] = !s[i]; int x = tryCombination(s); d[i] = x; s[i] = !s[i]; } answer(s , d); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...