제출 #623047

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
623047		Siffer	Comparing Plants (IOI20_plants)	C++14	0 / 100	1 ms	304 KiB

plants

#include "plants.h"
#include<bits/stdc++.h>
using namespace std;

#define F first
#define S second

vector<pair<int,int>> v;
int n;

void init(int p, vector<int> r) {
    n = r.size();
    int s = 0; for(;r[s]; s++); s++;
    v.resize(n);
    int b = s % n;
    int k = 0;
    for(int i = 0; i < n; i++) {
        v[(s+i)%n] = {b, k++};
        if(r[(s+i)%n] == 0) b = (s+i+1)%n, k = 0;
    }
}

int compare_plants(int x, int y) {
    if(y < x) return -compare_plants(y,x);
    if(v[x].F != v[y].F) {
        if(x == 0 && y == n-1) return -1;
        if(y-x == 1) return 1;
        return 0;
    }
    if(v[x].S > v[y].S) return 1;
    return -1;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 14
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 11
• Subtask 6: 0 / 15
• Subtask 7: 0 / 25