답안 #394283

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
394283 2021-04-26T10:53:52 Z snasibov05 식물 비교 (IOI20_plants) C++14
0 / 100
1 ms 284 KB
#include "plants.h"

using namespace std;

vector<int> sum;
int sm = 0;
int n;

void init(int k, vector<int> r) {

    n = r.size();

    sum.resize(n);
    sum[0] = r[0];
    for (int i = 1; i < n; ++i) {
        sum[i] = sum[i-1] + r[i];
        sm += r[i];
    }

}

int compare_plants(int x, int y) {

    if (x > y) swap(x, y);

    int k = sum[y-1];
    if (x != 0) k -= sum[x-1];

    if (k == y - x) return -1;
    if (k == 0) return 1;

    k = sm - k;
    if (k == (n - y) + x) return 1;
    if (k == 0) return -1;

	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Incorrect 1 ms 204 KB Output isn't correct
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 1 ms 280 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 1 ms 280 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 284 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Incorrect 1 ms 284 KB Output isn't correct
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 280 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Incorrect 1 ms 204 KB Output isn't correct
5 Halted 0 ms 0 KB -