oj.uz

Submission #1014705

# Submission time Handle Problem Language Result Execution time Memory
1014705 2024-07-05T10:10:04 Z Unforgettablepl Comparing Plants (IOI20_plants) C++17
0 / 100
 0 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;

vector<int> limit;
vector<int> p;

void init(int k, std::vector<int> r) {
	int n = r.size();
	p.resize(n);
	for(int i=0;i<n;i++)p[i]=min(max(0,r[i]-r[(i+1)%n]),1);
	r=p;
	limit.resize(n);
	vector<bool> visited(n);
	function<int(int,int)> dfs = [&](int x,int type){
		if(r[x]!=type)return x;
		if(visited[x])return limit[x];
		visited[x] = true;
		return limit[x] = dfs((x+1)%n,type);
	};
	for(int i=0;i<n;i++)dfs(i,r[i]);
}

int compare_plants(int x, int y) {
	if(x>y)return -compare_plants(y,x);
	if(limit[x]<x or y<=limit[x]){
		if(p[x])return -1;
		else return 1;
	}
	if(x<=limit[y] and limit[y]<y){
		if(p[y])return 1;
		else return -1;
	}
	return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 600 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 25.0

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