oj.uz

답안 #354263

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
354263 2021-01-21T16:01:08 Z ryansee 식물 비교 (IOI20_plants) C++14
25 / 100
 654 ms 4460 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, k;
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) { k=K;
	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]) {
			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);
	
	if(n <= 300) {
		FOR(i,0,n-1) {
			ll sm = LLINF, pos=-1;
			FOR(jj,i+1,i+k-1) { int j=cy(jj);
				if(A[i] < A[j]) {
					if(A[j] < sm) sm = A[j], pos = j;
				} else {
					v[j].eb(i);
				}
			}
			if(~pos) v[i].eb(pos);
		}
		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(min(y-x, n-y+x) < k || n > 300 || reach[x][y] || reach[y][x]) return A[x] < A[y] ? 1 : -1;
	else return 0;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 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 71 ms 3308 KB Output is correct
7 Incorrect 80 ms 3436 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 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 2 ms 492 KB Output is correct
6 Correct 20 ms 492 KB Output is correct
7 Correct 544 ms 3436 KB Output is correct
8 Correct 4 ms 748 KB Output is correct
9 Correct 20 ms 492 KB Output is correct
10 Correct 531 ms 3564 KB Output is correct
11 Correct 281 ms 3320 KB Output is correct
12 Correct 296 ms 3436 KB Output is correct
13 Correct 654 ms 3436 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 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 2 ms 492 KB Output is correct
6 Correct 20 ms 492 KB Output is correct
7 Correct 544 ms 3436 KB Output is correct
8 Correct 4 ms 748 KB Output is correct
9 Correct 20 ms 492 KB Output is correct
10 Correct 531 ms 3564 KB Output is correct
11 Correct 281 ms 3320 KB Output is correct
12 Correct 296 ms 3436 KB Output is correct
13 Correct 654 ms 3436 KB Output is correct
14 Incorrect 66 ms 3308 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 69 ms 3308 KB Output is correct
4 Incorrect 87 ms 4460 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 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 16 ms 1388 KB Output is correct
8 Correct 27 ms 1388 KB Output is correct
9 Correct 16 ms 1260 KB Output is correct
10 Correct 29 ms 1516 KB Output is correct
11 Correct 19 ms 1260 KB Output is correct
12 Correct 17 ms 1260 KB Output is correct
13 Correct 47 ms 1644 KB Output is correct

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 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 Incorrect 7 ms 492 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 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 71 ms 3308 KB Output is correct
7 Incorrect 80 ms 3436 KB Output isn't correct
8 Halted 0 ms 0 KB -