Submission #1072484

#TimeUsernameProblemLanguageResultExecution timeMemory
1072484pawnedMechanical Doll (IOI18_doll)C++17
2 / 100
24 ms8540 KiB
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops") #include <bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back typedef long long ll; typedef pair<int, int> ii; typedef vector<int> vi; #include "doll.h" void create_circuit(int M, vi A) { int N = A.size(); /* cout<<"A: "; for (int i = 0; i < N; i++) { cout<<A[i]<<" "; } cout<<endl;*/ vi allr[M + 1]; allr[0].pb(A[0]); for (int i = 0; i < N - 1; i++) { allr[A[i]].pb(A[i + 1]); } /* cout<<"allr: "<<endl; for (int i = 0; i < M; i++) { cout<<i<<": "; for (int x : allr[i]) cout<<x<<" "; cout<<endl; }*/ vi ans(M + 1, 0); for (int i = 0; i <= M; i++) { if (allr[i].size() != 0) ans[i] = allr[i][0]; } // create binary tree answer(ans, {}, {}); }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...