제출 #1291758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1291758		julia_08	식물 비교 (IOI20_plants)	C++20	0 / 100	2 ms	584 KiB

plants

#include <bits/stdc++.h>
#include "plants.h"

using namespace std;

const int MAXN = 5e3 + 10;

int cmp[MAXN][MAXN];

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

	int n = (int) r.size();

	for(int i=1; i<k; i++){

		for(int j=0; j<n; j++){

			int x = j, y = (j + i) % n;

			if(r[x] > r[y]){

				cmp[x][y] = -1;
				cmp[y][x] = 1;

			} else if(r[x] < r[y]){

				cmp[x][y] = 1;
				cmp[y][x] = -1;

			} else{

				// caso chato

				int z = (y + k - 1) % n;

				// nao pode ter igualdade

				if(cmp[z][x] == 1){

					// (z, x) = -1
					cmp[y][x] = -1;
					// (x, z) = 1
					cmp[x][y] = 1;


				} else if(cmp[z][x] == -1){

					cmp[y][x] = 1;
					cmp[x][y] = -1;

				}

			}

		}

		for(int j=0; j<n; j++){
			if(cmp[j][(j + i) % n] == -1){
				r[j] --;
			}
		}

	}

	for(int i=0; i<n; i++){
		for(int j=0; j<n; j++){
			if(i != j){
				assert(cmp[i][j] != 0);
			}
		}
	}

}

int compare_plants(int x, int y){
	return cmp[x][y];
}

• 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