oj.uz

Submission #354246

# Submission time Handle Problem Language Result Execution time Memory
354246 2021-01-21T15:34:10 Z ryansee Comparing Plants (IOI20_plants) C++14
11 / 100
 4000 ms 107776 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 (5002)
 
int n, start;
ll A[MAXN];
bitset<MAXN> gone;
inline ll cy(ll x) {
	x %= n, x += n, x %= n; return x;
}
vector<int> v[MAXN];
bitset<MAXN> reach[MAXN];
void init(int k, std::vector<int> r) {
	n=r.size(); if(n>5000) return;
	
	while(1) {
		start = -1;
		FOR(i,0,n-1) if(!gone[i] && r[i] == 0) {
			DEC(jj,i-1,i-k+1) {
				int j = (jj + n) % n;
				if(!gone[j] && r[j] == 0) goto no;
			}
			start = i;
			break;
			no:;
		}
		if(start == -1) break;
		
		FOR(i,start+1,start+k-1) if(!gone[i%n]) {
			A[i%n]=max(A[i%n], A[start]+1);
		}
		
		DEC(i,start-1,start-k+1) if(!gone[(i+n)%n]) {
			// assert(A[start]+1 >= A[(i+n)%n]);
			A[(i+n)%n] = max(A[(i+n)%n], A[start]+1), -- r[(i+n)%n];
		}
		gone[start] = 1;
	}
	FOR(i,0,n-1) assert(r[i]==0);
	// FOR(i,0,n-1) cerr<<A[i]<<' '; cerr<<'\n';
	
	FOR(i,0,n-1) FOR(jj,i+1,i+k-1) { int j=cy(jj);
		assert(A[i] ^ A[j]);
		if(A[i] < A[j]) v[i].eb(j);
		else v[j].eb(i);
	}
	function<void(ll,ll)>dfs=[&](ll x,ll o){
		if(reach[o][x]) return;
		reach[o][x]=1;
		for(auto i:v[x]) dfs(i, o);
	};
	FOR(i,0,n-1) dfs(i, i);
}
int compare_plants(int x, int y) {
	if(n > 5000) return 0;
	if(reach[x][y] || reach[y][x]) return A[x] < A[y] ? 1 : -1;
	else return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 74 ms 3308 KB Output is correct
7 Incorrect 70 ms 5484 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 2073 ms 6376 KB Output is correct
7 Execution timed out 4048 ms 107776 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 2073 ms 6376 KB Output is correct
7 Execution timed out 4048 ms 107776 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

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

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 2 ms 620 KB Output is correct
7 Correct 15 ms 1644 KB Output is correct
8 Correct 36 ms 1900 KB Output is correct
9 Correct 17 ms 1644 KB Output is correct
10 Correct 36 ms 1772 KB Output is correct
11 Correct 16 ms 1644 KB Output is correct
12 Correct 18 ms 1644 KB Output is correct
13 Correct 76 ms 2156 KB Output is correct

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 213 ms 1644 KB Output is correct
6 Incorrect 84 ms 6636 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 74 ms 3308 KB Output is correct
7 Incorrect 70 ms 5484 KB Output isn't correct
8 Halted 0 ms 0 KB -