oj.uz

Submission #652120

# Submission time Handle Problem Language Result Execution time Memory
652120 2022-10-21T11:00:51 Z mychecksedad Comparing Plants (IOI20_plants) C++17
0 / 100
 11 ms 19948 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
struct Dsu {
	vector<int> s, p;
	Dsu(int n){
		s.resize(n+1, 1);
		p.resize(n+1);
		for(int i = 0; i <= n; ++i) p[i] = i;
	}
	int find(int v){
		if(p[v] == v) return v;
		return (p[v] = find(p[v]));
	}
	void merge(int a, int b){
		a = find(a);
		b = find(b);
		if(a != b){
			if(s[a] > s[b]){
				swap(a, b);
			}
			s[b] += s[a];
			p[a] = b;
		}
	}
} d(N), d1(N);

vector<int> v, w(N, -1);
int nn;
void init(int k, vector<int> r){
	int n = r.size();
	nn =n ;
	v = r;
	for(int i = 0; i < n; ++i){
		if(r[i] == 1){
			d.merge(i, (i + 1)%n);
		}else{
			d1.merge(i, (i + 1)%n);
		}
	}
	int c = 0;
	for(int i = 0; i < n; ++i) c += (r[i] != r[(i + 1)%n]);
	if(c == 2){
		for(int i = 0; i < n; ++i){
			if(r[i] != r[(i+1)%n]){
				if(r[(i+1)%n] == 1){
					w[(i+1)%n] = n;
				}else{
					w[(i+1)%n] = 1;
				}
			}
		}
	}
}
int compare_plants(int x, int y){
	if(d.find(x) == d.find(y)){
		return 1;
	}else if(d1.find(x) == d1.find(y)){
		return -1;
	}
	if(w[x] == nn || w[y] == 1){
		return 1;
	}
	if(w[y] == nn || w[x] == 1){
		return -1;
	}
	return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 19836 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 25.0

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