oj.uz

답안 #369769

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
369769 2021-02-22T11:46:45 Z MilosMilutinovic 식물 비교 (IOI20_plants) C++14
0 / 100
 1 ms 512 KB 
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;

int n, k;
vector<int> a, sum;
int compare_plants(int x, int y) {
	if(sum[x]==sum[y-1])
		return 1;
	if(sum[n-1]-sum[y]==n-y-1&&(x==0||sum[x-1]==x))
		return 1;
	swap(x,y);
	if(sum[x]==sum[y-1])
		return -1;
	if(sum[n-1]-sum[y]==n-y-1&&(x==0||sum[x-1]==x))
		return -1;
	return 0;
}

void init(int K, vector<int> r) {
	n=(int)r.size(), k=K, a=r, sum=a, partial_sum(sum.begin(), sum.end(), sum.begin());
}

/*int main() {
	init(2, {0, 1, 0, 1});
	cout << compare_plants(1, 3);
	return 0;
}*/

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Halted 0 ms 0 KB -