oj.uz

Submission #404404

# Submission time Handle Problem Language Result Execution time Memory
404404 2021-05-14T11:27:25 Z AmineWeslati The short shank; Redemption (BOI21_prison) C++14
15 / 100
 2000 ms 50360 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e6 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////

int N,K,T; 
vpi vec; 

int main() {
    boost; IO();

    cin>>N>>K>>T;
    FOR(i,0,N){
    	int t; cin>>t;
    	if(t<=T) vec.eb(i,min(i+T-t,N-1));
    }

    int ans=0;
    vi sum(N+1,0);
    for(auto x: vec){
    	sum[x.fi]++;
    	sum[x.se+1]--;
    }
    int cur=0;
    FOR(i,0,N){
    	cur+=sum[i];
    	if(cur) ans++;
    }

    int rep=K;
    while(K--){
		vi v[N];
		for(auto x: vec){
			int l=x.fi,r=x.se;
			v[r].pb(r);
			if(l) v[l-1].pb(-r);
		}

		vi R(N,-1);
		multiset<int,greater<int>>s;
		ROF(i,0,N){
			for(auto x: v[i]){
				if(x>=0) s.insert(x);
				else s.erase(s.find(-x));
			}
			if(sz(s)) R[i]=*s.begin();
		}

		FOR(i,0,N) v[i].clear();
		for(auto x: vec){
			int l=x.fi,r=x.se;
			v[l].pb(r);
		}

		set<int>free;
		vi val(N,0);
		ROF(i,0,N){
			for(auto x: free){
				if(x<=R[i]) val[i]++;
			}

			if(!sz(v[i])) free.insert(i);
			for(int j: v[i]){
				while(sz(free) && *free.begin()<=j) 
					free.erase(free.begin());
			} 
		}

		int idx=0; 
		FOR(i,0,N){
			if(val[i]>val[idx]) idx=i;
		}
		ans-=val[idx];
		for(auto &x: vec){
			int l=x.fi,r=x.se;
			if(idx>=l) ckmin(x.se,idx);
		}

    }
    cout << ans << endl;
    

    return 0;
}
//Change your approach

Compilation message

prison.cpp: In function 'int main()':
prison.cpp:124:15: warning: unused variable 'r' [-Wunused-variable]
  124 |    int l=x.fi,r=x.se;
      |               ^
prison.cpp:79:9: warning: unused variable 'rep' [-Wunused-variable]
   79 |     int rep=K;
      |         ^~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 312 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 12 ms 300 KB Output is correct
5 Correct 33 ms 320 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 19 ms 352 KB Output is correct
8 Correct 4 ms 332 KB Output is correct
9 Correct 8 ms 324 KB Output is correct
10 Correct 23 ms 324 KB Output is correct
11 Correct 47 ms 332 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 283 ms 41116 KB Output is correct
3 Correct 250 ms 50360 KB Output is correct
4 Execution timed out 2052 ms 38600 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 312 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 12 ms 300 KB Output is correct
5 Correct 33 ms 320 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 19 ms 352 KB Output is correct
8 Correct 4 ms 332 KB Output is correct
9 Correct 8 ms 324 KB Output is correct
10 Correct 23 ms 324 KB Output is correct
11 Correct 47 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 2 ms 324 KB Output is correct
14 Correct 3 ms 308 KB Output is correct
15 Correct 11 ms 324 KB Output is correct
16 Correct 32 ms 340 KB Output is correct
17 Correct 2 ms 324 KB Output is correct
18 Correct 18 ms 308 KB Output is correct
19 Correct 5 ms 304 KB Output is correct
20 Correct 9 ms 320 KB Output is correct
21 Correct 23 ms 312 KB Output is correct
22 Correct 47 ms 332 KB Output is correct
23 Correct 620 ms 708 KB Output is correct
24 Correct 1447 ms 648 KB Output is correct
25 Execution timed out 2013 ms 628 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 755 ms 6520 KB Output is correct
3 Correct 577 ms 7032 KB Output is correct
4 Execution timed out 2085 ms 5824 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 312 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 12 ms 300 KB Output is correct
5 Correct 33 ms 320 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 19 ms 352 KB Output is correct
8 Correct 4 ms 332 KB Output is correct
9 Correct 8 ms 324 KB Output is correct
10 Correct 23 ms 324 KB Output is correct
11 Correct 47 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 2 ms 324 KB Output is correct
14 Correct 3 ms 308 KB Output is correct
15 Correct 11 ms 324 KB Output is correct
16 Correct 32 ms 340 KB Output is correct
17 Correct 2 ms 324 KB Output is correct
18 Correct 18 ms 308 KB Output is correct
19 Correct 5 ms 304 KB Output is correct
20 Correct 9 ms 320 KB Output is correct
21 Correct 23 ms 312 KB Output is correct
22 Correct 47 ms 332 KB Output is correct
23 Correct 620 ms 708 KB Output is correct
24 Correct 1447 ms 648 KB Output is correct
25 Execution timed out 2013 ms 628 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 312 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 12 ms 300 KB Output is correct
5 Correct 33 ms 320 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 19 ms 352 KB Output is correct
8 Correct 4 ms 332 KB Output is correct
9 Correct 8 ms 324 KB Output is correct
10 Correct 23 ms 324 KB Output is correct
11 Correct 47 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 283 ms 41116 KB Output is correct
14 Correct 250 ms 50360 KB Output is correct
15 Execution timed out 2052 ms 38600 KB Time limit exceeded
16 Halted 0 ms 0 KB -