Submission #371926

#TimeUsernameProblemLanguageResultExecution timeMemory
371926shrek12357Lost in the cycle (IOI19_cycle)C++14
11 / 100
3 ms512 KiB
#include <iostream> #include <vector> #include <algorithm> #include <string> #include <map> #include <set> #include <climits> #include <cmath> #include <fstream> #include <queue> #include <stack> #include <iomanip> #include <assert.h> #include <bitset> #include "cycle.h" using namespace std; #define ll long long //cin.tie(0);ios_base::sync_with_stdio(0); void escape(int n) { vector<int> vals; vals.push_back(jump(0)); for (int i = 0; i < n; i++) { vals.push_back(jump(1)); } for (int i = 0; i < n - 1; i++) { if (vals[i] == 1 && vals[i + 1] == 0) { jump(i); return; } } jump(n - 1); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...