Submission #813400

#TimeUsernameProblemLanguageResultExecution timeMemory
813400arnold518Ancient Machine 2 (JOI23_ancient2)C++17
0 / 100
0 ms208 KiB
#include "ancient2.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; namespace { int N, M; } string Solve(int _N) { N=_N; string ans; M=N+2; printf("%d\n", M); for(int i=0; i<N; i++) { vector<int> A(M), B(M); for(int j=0; j<i; j++) A[j]=j+1, B[j]=j+1; A[i]=i+1; B[i]=i+2; for(int j=i+1; j<M; j++) A[j]=j, B[j]=j; int t=Query(M, A, B); if(t==i+1) ans+="0"; else ans+="1"; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...