oj.uz

답안 #303315

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
303315 2020-09-20T07:55:27 Z Utaha 식물 비교 (IOI20_plants) C++14
0 / 100
 1 ms 256 KB 
#include "plants.h"
#include<bits/stdc++.h>
using namespace std;
int n,k;
vector<int> v;

void init(int _k, std::vector<int> r) {
	v = r;
	k = _k;
	return;
}

bool between(int idx,int l,int r){
	if(l<=idx&&idx<r) return 1;
	if(l<=idx+n&&idx+n<r) return 1;
	return 0;
}

int compare_plants(int x, int y) {
	if(between(y,x,x+k)){
		if(v[x]==0) return 1;
		else if(v[x] == k-1) return -1;
	}
	if(between(x,y,y+k)){
		if(v[y]==0) return -1;
		else if(v[y] == k-1) return 1;
	}
	return 0;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 25.0

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