oj.uz

Submission #354224

# Submission time Handle Problem Language Result Execution time Memory
354224 2021-01-21T14:59:32 Z ryansee Comparing Plants (IOI20_plants) C++14
14 / 100
 4000 ms 5356 KB 
#include "plants.h"
 
#include "bits/stdc++.h"
using namespace std;
 
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }
 
using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 
 
long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (200006)
 
int n, start;
ll A[MAXN];
bitset<MAXN> gone, done;
inline ll cy(ll x) {
	x %= n, x += n, x %= n; return x;
}
void init(int k, std::vector<int> r) {
	n=r.size();
	function<void(int,int,bool)> zero=[&](int x,int op,bool can){
		FOR(j,x+1,x+k-1) if(!gone[cy(j)]) {
			if((can || done[cy(j)]) && r[cy(j)]==0) zero(cy(j), -1, can);
			r[cy(j)] += op;
			if((can || done[cy(j)]) && r[cy(j)]==0) zero(cy(j), 1, can);
		}
	};
	FOR(i,0,n-1) if(r[i]==0) gone[i]=1, done[i]=1, zero(i, 1, 0), gone[i]=0;
	while(1) {
		start = -1;
		FOR(i,0,n-1) if(!gone[i] && r[i] == 0) start = i;
		if(start == -1) break;
		gone[start]=1, zero(start, -1, 1);
		FOR(i,start+1,start+k-1) if(!gone[cy(i)]) {
			A[cy(i)]=max(A[cy(i)], A[start]+1);
		}
		DEC(i,start-1,start-k+1) if(!gone[cy(i)]) {
			A[cy(i)] = max(A[cy(i)], A[start]+1);
			-- r[cy(i)];
			if(r[cy(i)]==0) zero(cy(i), 1, 1);
		}
	}
	FOR(i,0,n-1) assert(r[i]==0);
}
int compare_plants(int x, int y) {
	return A[x] < A[y] ? 1 : -1;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Incorrect 1 ms 364 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 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 64 ms 492 KB Output is correct
7 Correct 1676 ms 5116 KB Output is correct
8 Correct 3 ms 492 KB Output is correct
9 Correct 67 ms 620 KB Output is correct
10 Correct 1661 ms 5244 KB Output is correct
11 Correct 901 ms 5228 KB Output is correct
12 Correct 823 ms 5356 KB Output is correct
13 Correct 1858 ms 5244 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 64 ms 492 KB Output is correct
7 Correct 1676 ms 5116 KB Output is correct
8 Correct 3 ms 492 KB Output is correct
9 Correct 67 ms 620 KB Output is correct
10 Correct 1661 ms 5244 KB Output is correct
11 Correct 901 ms 5228 KB Output is correct
12 Correct 823 ms 5356 KB Output is correct
13 Correct 1858 ms 5244 KB Output is correct
14 Execution timed out 4067 ms 5228 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Runtime error 2 ms 492 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Runtime error 1 ms 492 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 0 ms 364 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 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Incorrect 1 ms 364 KB Output isn't correct
5 Halted 0 ms 0 KB -