Submission #959174

#TimeUsernameProblemLanguageResultExecution timeMemory
959174KavelmydexBroken Device (JOI17_broken_device)C++17
8 / 100
33 ms2832 KiB
#include "Annalib.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define pi pair<int,int> #define vi vector<int> #define rep(i,x,n) for(int i=x; i<n; ++i) #define For(i,n) rep(i,0,n) #define endl "\n" #define sp ' ' #define pb push_back #define f first #define s second #define sz size() #define all(x) (x).begin(),(x).end() const int NN = 200, OO = 1e9, mod = 1e9+7; int mp[NN], ans[NN]; void Anna( int n, long long x, int k, int p[] ){ memset(mp,0,sizeof(mp)); memset(ans,0,sizeof(ans)); For(i,k){ mp[p[i]] = 1; } vi v; For(i,60){ if((1LL<<i) & x){ v.pb(i); } } for(int i=0; i<=89; ++i){ bool ok = 1; for(int j=i; j<=i+60; ++j){ ok &= (!mp[j]); } if(ok){ ans[i] = 1; for(int x: v){ ans[i+x+1] = 1; } break; } } For(i,n){ Set(i,ans[i]); } }
#include "Brunolib.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define pi pair<int,int> #define vi vector<int> #define rep(i,x,n) for(int i=x; i<n; ++i) #define For(i,n) rep(i,0,n) #define endl "\n" #define sp ' ' #define pb push_back #define f first #define s second #define sz size() #define all(x) (x).begin(),(x).end() long long Bruno( int N, int A[] ){ int fi = 0; For(i,N){ if(A[i]) { fi = i; break; } } ll ans = 0; for(int i=fi+1; i<N; ++i){ if(A[i]){ ans += (1LL<<(i-fi-1)); } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...