Submission #1232068

#TimeUsernameProblemLanguageResultExecution timeMemory
1232068lolokaPrisoner Challenge (IOI22_prison)C++20
0 / 100
0 ms324 KiB
#include "prison.h" #include<bits/stdc++.h> using namespace std; vector<vector<int>> devise_strategy(int N) { vector<vector<int>> s; for(int i = 0; i < 50; i++) { vector<int> v; if(i / 10 == 0) v.push_back(0); else v.push_back(1); for(int j = 1; j <= N; j++) { int a[5]; a[1] = j / 1000; a[2] = (j / 100) % 10; a[3] = (j / 10) % 10; a[4] = j % 10; if(i / 10 != 0) { if(i % 10 < a[i / 10]) v.push_back(-2); else if(i % 10 > a[i / 10]) v.push_back(-1); else v.push_back(i / 10 + 1); } else { v.push_back((i / 10) * 10 + a[i / 10]); } } s.push_back(v); } return s; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...