oj.uz

Submission #1051461

# Submission time Handle Problem Language Result Execution time Memory
1051461 2024-08-10T07:11:44 Z LittleOrange Comparing Plants (IOI20_plants) C++17
0 / 100
 1 ms 348 KB 
#include "plants.h"
#include<bits/stdc++.h>
using namespace std;
using ll = int;
namespace{
	vector<ll> a;
	ll n;
}

void init(int k, std::vector<int> r) {
	n = r.size();
	a.resize(n+1,0);
	for(ll i = 0;i<n;i++) a[i+1] = a[i]+(r[i]>r[(i+n-1)%n]);
}

int compare_plants(int x, int y) {
	if (a[y]-a[x]==y-x) return -1;
	if (a[y]-a[x]==0) return 1;
	if (a[n]-a[y]+a[x]==0) return -1;
	if (a[n]-a[y]+a[x]==n-y+x) return 1;
	return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

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

Subtask #7
0 / 25.0

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