oj.uz

Submission #283553

# Submission time Handle Problem Language Result Execution time Memory
283553 2020-08-26T00:52:18 Z NaimSS Vođe (COCI17_vode) C++14
120 / 120
 373 ms 300024 KB 
#include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define td(v) v.begin(),v.end()
#define sz(v) (int)v.size()
//#define int long long
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
#define left sefude
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
typedef long long ll;
typedef pair<int,int> pii;
inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll a,ll b,ll m){
    if(b==0LL) return 1LL;
    if(b==1LL) return mod(a,m);
    ll k = mod(exp(a,b/2,m),m);
    if(b&1LL){
        return mod(a*mod(k*k,m),m);
    }
    else return mod(k*k,m);
}


const int N = 5050;
int dp[N*3 + 10][N];
int v[N];
int pre[N];
vi ids;

int32_t main(){
  fastio;
  int n,m,k;
  cin >> n >> m >> k;
  for(int i=1;i<=n;i++){
    ids.pb(i);
    cin >> v[i];
  }
  int cur = 1;
  while(sz(ids)< 3*N - 1){
    ids.pb(cur);
    cur = (cur == n ? 1 : cur + 1);
  }

  for(int pos = sz(ids)-1;pos>=0;pos -- ){
    if(pos == sz(ids) - 1){
      for(int j=0;j<m-1;j++)dp[pos][j] = 1;
      dp[pos][m-1] = dp[pos][m] = 0;
    }else{
      int cur = v[ids[pos]];
      int nxt = v[ids[pos+1]];

      for(int j=0;j<m-1;j++){
        dp[pos][j]=0;
        if(cur == nxt){
          dp[pos][j] = (pre[min(m,j + k)] - pre[j]) > 0;
        }else dp[pos][j] = (pre[min(m,j+k)]-pre[j]!=min(m,j+k)-j);
      }
      dp[pos][m-1] = dp[pos][m] = 0;
    }
    for(int j=0;j<=m;j++)pre[j] = (j == 0 ? 0 : pre[j-1]) + dp[pos][j];
  }
  
  for(int pos=0;pos<n;pos++){

    if(dp[pos][0] == 1)cout << v[ids[pos]] <<" ";
    else cout <<!v[ids[pos]] <<" ";
  }
  cout << endl;
  

  // math -> gcd it all
  // Did u check N=1? Did you switch N,M?
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 66432 KB Output is correct
2 Correct 35 ms 66304 KB Output is correct
3 Correct 37 ms 66296 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 89848 KB Output is correct
2 Correct 42 ms 72056 KB Output is correct
3 Correct 55 ms 85692 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 77688 KB Output is correct
2 Correct 46 ms 77304 KB Output is correct
3 Correct 52 ms 78080 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 83576 KB Output is correct
2 Correct 54 ms 83192 KB Output is correct
3 Correct 55 ms 83320 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 88812 KB Output is correct
2 Correct 64 ms 87288 KB Output is correct
3 Correct 52 ms 84344 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 89720 KB Output is correct
2 Correct 62 ms 90104 KB Output is correct
3 Correct 30 ms 62208 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 159484 KB Output is correct
2 Correct 151 ms 170360 KB Output is correct
3 Correct 346 ms 300008 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 230776 KB Output is correct
2 Correct 318 ms 299896 KB Output is correct
3 Correct 211 ms 222328 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 336 ms 300024 KB Output is correct
2 Correct 326 ms 299896 KB Output is correct
3 Correct 290 ms 299956 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 373 ms 299896 KB Output is correct
2 Correct 365 ms 299896 KB Output is correct
3 Correct 315 ms 299896 KB Output is correct