제출 #251908

#제출 시각아이디문제언어결과실행 시간메모리
251908oolimryOn the Grid (FXCUP4_grid)C++17
12 / 100
4 ms416 KiB
#include "grid.h" #include <bits/stdc++.h> using namespace std; vector<int> SortDisks(int N) { deque<int> D; for(int i = 0;i < N;i++) D.push_back(i); deque<int> T; int need = 2*N-1; while(!D.empty()){ vector<int> S; for(int x : D) S.push_back(x); for(int x : T) S.push_back(x); int d = D.front(); D.pop_front(); int res = PutDisks(S); //for(int x : S) cout << size[x] << " "; //cout << res << "res\n"; if(res == need){ T.push_front(d); need--; } else{ D.push_back(d); } } vector<int> ans(N); for(int i = 0;i < N;i++) ans[T[i]] = i+1; return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...