oj.uz

답안 #352402

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
352402 2021-01-20T17:45:14 Z ryansee 식물 비교 (IOI20_plants) C++14
14 / 100
 4000 ms 7908 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], hmm[MAXN];
bitset<MAXN> gone;
struct u {
	int p[MAXN];
	u() {
		FOR(i,0,MAXN-1) p[i]=i;
	}
	int find(int x) { return p[x] == x ? x : p[x] = find(p[x]); }
	void merge(int x,int y) { p[find(x)]=find(y); }
	bool same(int a,int b) { return find(a)==find(b); }
} u1, u2;

void init(int k, std::vector<int> r) {
	n=r.size(), mmst(hmm, -1);
	
	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]) {
			// assert(A[start]+1 > A[i%n]);
			A[i%n]=max(A[i%n], A[start]+1), hmm[i%n]=start;
		}
		
		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) if(A[i]==0) { start = i; break; }
	for(ll now=start;;) {
		++ now;
		while(A[now%n]) {
			u1.merge(now%n, (now-1+n)%n);
			++ now;
		}
		if(now%n == start) break;
	}
	
	for(ll now=start;;) {
		-- now;
		while(A[(now+n)%n]) {
			// cerr<<"merge: "<<(now+n)%n<<' '<<(now+1+n)%n<<'\n';
			u2.merge((now+n)%n, (now+1+n)%n);
			-- now;
		}
		if((now+n)%n == start) break;
	}
}

int compare_plants(int x, int y) {
	if((!u1.same(x,y) && !u2.same(x,y)) || A[x] == A[y]) return 0;
	return A[x] < A[y] ? 1 : -1;
}

Subtask #1
0 / 5.0

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

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3436 KB Output is correct
2 Correct 2 ms 3436 KB Output is correct
3 Correct 2 ms 3436 KB Output is correct
4 Correct 2 ms 3436 KB Output is correct
5 Correct 4 ms 3436 KB Output is correct
6 Correct 23 ms 3564 KB Output is correct
7 Correct 548 ms 6508 KB Output is correct
8 Correct 4 ms 3564 KB Output is correct
9 Correct 21 ms 3564 KB Output is correct
10 Correct 528 ms 6508 KB Output is correct
11 Correct 283 ms 6380 KB Output is correct
12 Correct 301 ms 6508 KB Output is correct
13 Correct 659 ms 6508 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3436 KB Output is correct
2 Correct 2 ms 3436 KB Output is correct
3 Correct 2 ms 3436 KB Output is correct
4 Correct 2 ms 3436 KB Output is correct
5 Correct 4 ms 3436 KB Output is correct
6 Correct 23 ms 3564 KB Output is correct
7 Correct 548 ms 6508 KB Output is correct
8 Correct 4 ms 3564 KB Output is correct
9 Correct 21 ms 3564 KB Output is correct
10 Correct 528 ms 6508 KB Output is correct
11 Correct 283 ms 6380 KB Output is correct
12 Correct 301 ms 6508 KB Output is correct
13 Correct 659 ms 6508 KB Output is correct
14 Execution timed out 4086 ms 6124 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3436 KB Output is correct
2 Correct 2 ms 3436 KB Output is correct
3 Correct 82 ms 6304 KB Output is correct
4 Execution timed out 4041 ms 7908 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 25.0

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