oj.uz

Submission #1039840

# Submission time Handle Problem Language Result Execution time Memory
1039840 2024-07-31T10:23:10 Z amirhoseinfar1385 Comparing Plants (IOI20_plants) C++17
0 / 100
 1 ms 348 KB 
#include "plants.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=300+10;
int all[maxn],tr[maxn],res[maxn][maxn],fake[maxn];
int k,n;

void init(int k_, std::vector<int> r) {
	k=k_;
	n=(int)r.size();
	for(int i=0;i<n;i++){
		all[i]=r[i];
	}
}

int compare_plants(int x, int y) {
	for(int i=0;i<n;i++){
		fake[i]=all[i];
	}
	for(int i=0;i<n;i++){
		vector<int>tof;
		int vis1=0,vis2=0;
		for(int j=0;j<n;j++){
			if(fake[j]==0){
				if(j==x){
					vis1=1;
				}else if(j==y){
					vis2=1;
				}
				tof.push_back(j);
			}
		//	cout<<"ha: "<<i<<" "<<j<<" "<<fake[j]<<endl;
		}
		vector<int>tofy;
		for(int j=(int)tof.size()-1;j>0;j--){
			if(tof[j]-tof[j-1]>=k){
				tofy.push_back(tof[j]);
			}
		}
		if((tof[0]-tof.back()+n)%n>=k){
			tofy.push_back(tof[0]);
		}
		//cout<<x<<" "<<y<<" "<<(int)tofy.size()<<" "<<vis1<<" "<<vis2<<endl;
		while((int)tofy.size()>0&&(tofy.back()==x||tofy.back()==y)){
			tofy.pop_back();
		}
		//cout<<x<<" "<<y<<" "<<(int)tofy.size()<<" "<<vis1<<" "<<vis2<<endl;
	//	if((int)tofy.size()>0){
	//		cout<<tofy.back()<<endl;
	//	}
		if(vis1==1&&vis2==1){
			return 0;
		}
		if((int)tofy.size()==0){
			if(vis1){
				return 1;
			}else{
				return -1;
			}
		}
		for(int h=1;h<=k-1;h++){
			fake[(tofy.back()-h+n)%n]--;
		}
	}
	return 1;
}

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 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 #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 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 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 Incorrect 0 ms 348 KB Output isn't correct
4 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 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -