Submission #131745

#TimeUsernameProblemLanguageResultExecution timeMemory
131745MohamedAhmed04Broken Device (JOI17_broken_device)C++14
0 / 100
57 ms3056 KiB
#include "Annalib.h" #include <bits/stdc++.h> using namespace std ; void Anna( int N, long long X, int K, int P[] ) { srand(123321) ; vector<int>v ; for(int i = 0 ; i < N ; ++i) v.push_back(i) ; random_shuffle(v.begin() , v.end()) ; int mark[N+1] ; for(int i = 0 ; i <= N ; ++i) mark[i] = 0 ; for(int i = 0 ; i < K ; ++i) mark[P[i]] = 1; int last = -1 ; for(int i = 0 ; i < N ; i += 2) { last = i+1 ; if(X == 0) { Set(v[i] , 0) ; Set(v[i+1] , 0) ; continue ; } int now = X % 3 ; X /= 3 ; if(now == 0 && mark[v[i+1]] == 0) { Set(v[i] , 0) ; Set(v[i+1] , 1) ; continue ; } if(now == 1 && mark[v[i]] == 0) { Set(v[i] , 1) ; Set(v[i+1] , 0) ; continue ; } if(now == 2 && mark[v[i]] == 0 && mark[v[i+1]] == 0) { Set(v[i] , 1) ; Set(v[i+1] , 1) ; continue ; } Set(v[i] , 0) ; Set(v[i+1] , 0) ; } if(last < N-1) Set(v[N-1] , 0) ; }
#include "Brunolib.h" #include <bits/stdc++.h> using namespace std ; long long Bruno( int N, int A[] ) { srand(123321) ; vector<int>v ; for(int i = 0 ; i < N ; ++i) v.push_back(i) ; random_shuffle(v.begin() , v.end()) ; vector<int>v1 ; long long ans = 0ll ; for(int i = 0 ; i < N-1 ; i += 2) { if(A[v[i]] == 0 && A[v[i+1]] == 0) continue ; if(A[v[i]] == 0 && A[v[i+1]] == 1) v1.push_back(0) ; else if(A[v[i]] == 1 && A[v[i+1]] == 0) v1.push_back(1) ; else if(A[v[i]] == 1 && A[v[i+1]] == 1) v1.push_back(2) ; } reverse(v1.begin() , v1.end()) ; for(auto &i : v1) ans = ans * 3ll + i * 1ll ; return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...