Submission #990397

#TimeUsernameProblemLanguageResultExecution timeMemory
990397amine_arouaBroken Device (JOI17_broken_device)C++17
0 / 100
34 ms2868 KiB
#include "Annalib.h" #include<bits/stdc++.h> using namespace std; #define fore(i , n ) for(int i = 0 ; i < n; i++) void Anna( int N, long long X, int K, int P[] ) { srand(6661); vector<int> final(N , 0); vector<bool> forbidden(N , 0); vector<int> seq(N); fore(i , N) seq[i] = i; random_shuffle(seq.begin() , seq.end()); fore(i , K) forbidden[P[i]] = 1; for(int i = 0 ;i + 1< N;i+=2) { int cur = X%3; if(forbidden[seq[i]] == 1 && forbidden[seq[i + 1]] == 1) continue; if(forbidden[seq[i]] && (cur == 0 || cur == 2)) continue; if(forbidden[seq[i + 1]] && (cur == 1 || cur == 2)) X/=2; if(cur == 0) final[seq[i]] = 1; else if(cur == 1) final[seq[i + 1]] = 1; else final[seq[i]] = final[seq[i + 1]] = 1; } fore(i , N) Set(i , final[i]); }
#include "Brunolib.h" #include <bits/stdc++.h> #define pb push_back #define Int long long #define fore(i , n ) for(int i = 0 ; i < n; i++) using namespace std; long long Bruno( int N, int A[] ){ srand(6661); vector<int> seq(N); fore(i , N) seq[i] = i; random_shuffle(seq.begin() , seq.end()); vector<int> po; for(int i = 0 ;i + 1 < N ; i+=2) { if(A[seq[i]] == 1 && A[seq[i + 1]] == 1) po.pb(2); else if(A[seq[i]] == 1) po.pb(0); else if(A[seq[i + 1]] == 1) po.pb(1); } reverse(po.begin() , po.end()); Int X = 0; for(auto x : po) X = 3*X + x; return X; }
#Verdict Execution timeMemoryGrader output
Fetching results...