Submission #793425

#TimeUsernameProblemLanguageResultExecution timeMemory
793425AntekbBroken Device (JOI17_broken_device)C++17
0 / 100
175 ms2472 KiB
#include<bits/stdc++.h> #pragma GCC optimize("Ofast") //#pragma GCC optimize("trapv") #define st first #define nd second #define pb push_back #define eb emplace_back #define pp(x) pop_back(x) #define mp(a, b) make_pair(a, b) #define all(x) (x).begin(), (x).end() #define rev(x) reverse(all(x)) #define sor(x) sort(all(x)) #define sz(x) (int)(x).size() #define rsz(x) resize(x) using namespace std; ///~~~~~~~~~~~~~~~~~~~~~~~~~~ template <typename H, typename T> ostream& operator<<(ostream& os, pair<H, T> m){ return os <<"("<< m.st<<", "<<m.nd<<")"; } template <typename H> ostream& operator<<(ostream& os, vector<H> V){ os<<"{"; for(int i=0; i<V.size(); i++){ if(i)os<<" "; os<<V[i]; } os<<"}"; return os; } void debug(){cerr<<"\n";} template <typename H, typename... T> void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);} #define deb(x...) cerr<<#x<<" = ";debug(x); //#define deb(x...) ; ///~~~~~~~~~~~~~~~~~~~~~~~~~ typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<pii > vii; typedef vector<ll> vl; typedef vector<pll> vll; typedef string str; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; #define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); #include "Annalib.h" void Anna( int n, long long X, int K, int P[] ){ srand(24636346); vi kol(n), co(n); iota(all(kol), 0); random_shuffle(all(kol)); vi val(n); int blo=6; int pot=1001; for(int i=0; i<n; i++){ val[i]=rand()%pot; co[kol[i]]=i; } for(int i=0; i<K; i++){ //deb(kol[P[i]]); val[kol[P[i]]]=0; } vi ans(n); for(int i=0; i<blo; i++){ //deb(i); int reszta=X%pot; X/=pot; vi tim(pot, 1e9); tim[0]=-1; for(int j=i*n/blo; j<(i+1)*n/blo; j++){ int t=val[j]; //deb(t, j); for(int k=t; k<pot; k++){ if(tim[k]==1e9 && tim[k-t]<j)tim[k]=j; } for(int k=0; k<t; k++){ if(tim[k]==1e9 && tim[k+pot-t]<j)tim[k]=j; } if(tim[reszta]!=1e9){ //deb("a"); break; } } while(reszta){ //deb(reszta); ans[co[tim[reszta]]]=1; int t=val[tim[reszta]]; //deb(t); reszta=(reszta+pot-t)%pot; } } for( int i = 0; i < n; i++ ){ Set( i, ans[i] ); } }
#include<bits/stdc++.h> #pragma GCC optimize("Ofast") //#pragma GCC optimize("trapv") #define st first #define nd second #define pb push_back #define eb emplace_back #define pp(x) pop_back(x) #define mp(a, b) make_pair(a, b) #define all(x) (x).begin(), (x).end() #define rev(x) reverse(all(x)) #define sor(x) sort(all(x)) #define sz(x) (int)(x).size() #define rsz(x) resize(x) using namespace std; ///~~~~~~~~~~~~~~~~~~~~~~~~~ typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<pii > vii; typedef vector<ll> vl; typedef vector<pll> vll; typedef string str; #include "Brunolib.h" long long Bruno( int n, int A[] ){ srand(24636346); vi kol(n), co(n); iota(all(kol), 0); random_shuffle(all(kol)); vi val(n); int blo=6; int pot=1001; for(int i=0; i<n; i++){ val[i]=rand()%pot; co[kol[i]]=i; } ll ans=0; for(int i=blo-1; i>=0; i--){ ans*=pot; int reszta=0; for(int j=i*n/blo; j<(i+1)*n/blo; j++){ if(A[co[j]]){ //cerr<<val[j]<<"\n"; reszta+=val[j]; } } ans+=reszta%pot; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...