oj.uz

Submission #1058846

# Submission time Handle Problem Language Result Execution time Memory
1058846 2024-08-14T14:25:47 Z Lalic Comparing Plants (IOI20_plants) C++17
14 / 100
 4000 ms 8836 KB 
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define mp make_pair

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef complex<double> cd;

const int MAXN = 2e5+10;

int cam[MAXN], N;

void init(int k, vector<int> r) {
	N=(int)r.size();
	
	int cnt=0;
	while(1){
		vector<int> zero;
		for(int i=0;i<N;i++)
			if(!r[i]) zero.pb(i);
		
		if(zero.empty()) break;
		
		vector<int> proc;
		if((int)zero.size()==1 || zero[0]-zero[(int)zero.size()-1]+N>=k) proc.pb(zero[0]);
		
		for(int i=1;i<(int)zero.size();i++)
			if(zero[i]-zero[i-1]>=k) proc.pb(zero[i]);
			
		for(auto u : proc){
			cam[u]=cnt;
			for(int i=u;i>=u-k+1;i--)
				r[(i+N)%N]--;
		}
		
		cnt++;
	}
}

int compare_plants(int x, int y) {
	if(cam[x]==cam[y]) return 0;
	if(cam[x]<cam[y]) return 1;
	return -1;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 75 ms 5204 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 3 ms 480 KB Output is correct
10 Correct 74 ms 4996 KB Output is correct
11 Correct 82 ms 4944 KB Output is correct
12 Correct 63 ms 5248 KB Output is correct
13 Correct 82 ms 5200 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 75 ms 5204 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 3 ms 480 KB Output is correct
10 Correct 74 ms 4996 KB Output is correct
11 Correct 82 ms 4944 KB Output is correct
12 Correct 63 ms 5248 KB Output is correct
13 Correct 82 ms 5200 KB Output is correct
14 Correct 608 ms 5500 KB Output is correct
15 Execution timed out 4048 ms 8836 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Correct 29 ms 4980 KB Output is correct
4 Execution timed out 4038 ms 8060 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -