Submission #251837

#TimeUsernameProblemLanguageResultExecution timeMemory
251837leakedVođe (COCI17_vode)C++14
0 / 120
4 ms384 KiB
#include<bits/stdc++.h> using namespace std; //#include<ext/pb_ds/assoc_container.hpp> //#include<ext/pb_ds/tree_policy.hpp> // // #pragma GCC optimize("unroll-loops") // #pragma GCC optimize("Ofast") // #pragma GCC optimize("-O3") // #pragma GCC optimize("no-stack-protector") // #pragma GCC optimize("fast-math") //#define LOCAL #define sim template < class c #define ris return * this #define dor > debug & operator << #define eni(x) sim > typename \ enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) { sim > struct rge { c b, e; }; sim > rge<c> range(c i, c j) { return rge<c>{i, j}; } sim > auto dud(c* x) -> decltype(cerr << *x, 0); sim > char dud(...); struct debug { #ifndef LOCAL ~debug() { cerr << endl; } eni(!=) cerr << boolalpha << i; ris; } eni(==) ris << range(begin(i), end(i)); } sim, class b dor(pair < b, c > d) { ris << "(" << d.first << ", " << d.second << ")"; } sim dor(rge<c> d) { *this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]"; } #else sim dor(const c&) { ris; } #endif }; #define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] " #define fi first #define f first #define se second #define s second #define vi_a vector<int>a; #define p_b push_back ////////////////////////////////???????????????CHECK THIS OUT???????????????////////////////////////////// #define ll long long typedef unsigned long long ull; ////////////////////////////////???????????????CHECK THIS OUT???????????????////////////////////////////// #define ld long double #define pll pair<ll,ll> #define pii pair<int,int> #define m_p make_pair #define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0); #define all(x) x.begin(),x.end() #define getfiles ifstream cin("input.txt");ofstream cout("output.txt"); #define pw(x) (1ll << x) #define sz(x) (int)x.size() #define endl "\n" #define rall(x) x.rbegin(),x.rend() #define len(a) (ll)a.size() #define rep(x,l,r) for(ll x=l;x<r;x++) //using namespace __gnu_pbds; ld eps = (ld)1 / 1e6; const ld pi=3.14159265359; ll inf = 1e18,mod1=1e9+7; ll sqr(ll a) { return a * a; } ll qb(ll a) { return a * a * a; } ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); } ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; } ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; } ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// const ll R=1e4; const ll tx[4]={0,0,-1,1}; const ll ty[4]={-1,1,0,0}; const char rev_to[4]={'E','W','N','S'}; const int N=1e6+1e5; const int M=1e9+7; //typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st; auto rnd=bind(uniform_int_distribution<ll>(1,1e18),mt19937(time(0))); bool used[N]; signed main() { fast_io; int n,m,k; cin>>n>>m>>k; vector<int>a(n); for(auto &z : a) cin>>z; auto nxt=[&](int i){ int j=i;j++;j%=n; return j; }; for(int i=0;i<n;i++){ bool tp=a[i]; int j=i; int l=1,r=k; bool ok=1; while(1){ ok=0; int nx=nxt(j); if(a[nx]==a[j]){ l++;r=r+k+1; } else{ if(r==m){ cout<<a[j]<<' '; break; }else{ l++; int k=nx; int cnt=0; while(a[k]==a[nx]){ k=nxt(k);cnt++; } r=min(r,m-cnt*k); if(l>r){ cout<<a[nx]<<' '; break; } } } if(l>r || l>m){ cout<<a[j]<<' '; break; } j=nx; } } return 0; } /* 01011 / 11100 / 11011 / 10110 / */

Compilation message (stderr)

vode.cpp: In function 'int main()':
vode.cpp:95:14: warning: unused variable 'tp' [-Wunused-variable]
         bool tp=a[i];
              ^~
vode.cpp:98:14: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
         bool ok=1;
              ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...