oj.uz

Submission #769029

# Submission time Handle Problem Language Result Execution time Memory
769029 2023-06-29T05:20:32 Z ono_de206 Comparing Plants (IOI20_plants) C++14
0 / 100
 1 ms 304 KB 
#include "plants.h"
#include<bits/stdc++.h>
using namespace std;

#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

// #define int long long
 
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

vector<int> a;
set<int> s;
int n, k;

bool check(int i) {
	if(s.size() == 1) return 1;
	s.erase(i);
	auto l = s.lower_bound(i);
	if(l == s.end()) l = s.begin();
	if(abs((*l) - i) < k) {
		s.in(i);
		return 0;
	}
	l = s.lower_bound(i);
	if(l == s.begin()) l = prev(s.end());
	l--;
	if(abs((*l) - i) < k) {
		s.in(i);
		return 0;
	}
	s.in(i);
	return 1;
}

void init(int _k, vector<int> r) {
	k = _k;
	n = r.size();
	a.resize(n);
	for(int i = 0; i < n; i++) {
		if(r[i] == 0) s.in(i);
	}
	int now;
	for(int i = 0; i < n; i++) {
		if(r[i] == 0 && check(i)) now = i;
	}
	for(int i = n; i >= 1; i--) {
		a[now] = i;
		r[now] = -1;
		s.erase(now);
		for(int j = 1; j < k; j++) {
			int id = (now - j + n) % n;
			r[id]--;
			if(r[id] == 0) s.in(id);
		}
		for(int j = 1; j < k; j++) {
			int id = (now - j + n) % n;
			if(r[id] == 0 && check(id)) {
				now = id;
				break;
			}
			id = (now + j) % n;
			if(r[id] == 0 && check(id)) {
				now = id;
				break;
			}
		}
	}
}

int compare_plants(int x, int y) {
	if(a[x] > a[y]) return 1;
	else return -1;
	return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

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

Subtask #7
0 / 25.0

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