제출 #255768

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
255768		dolphingarlic	팀들 (IOI15_teams)	C++14	34 / 100	4054 ms	34964 KiB

teams

#include "teams.h"
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
using namespace std;

multiset<pair<int, int>> students;

void init(int N, int A[], int B[]) {
	FOR(i, 0, N) students.insert({B[i], A[i]});
}

int can(int M, int K[]) {
	sort(K, K + M);
	vector<pair<int, int>> removed;
	FOR(i, 0, M) {
		vector<pair<int, int>> to_remove;
		for (pair<int, int> j : students) {
			if (K[i] <= j.first && K[i] >= j.second) to_remove.push_back(j);
			if (to_remove.size() == K[i]) break;
		}
		if (to_remove.size() != K[i]) {
			for (pair<int, int> j : removed) students.insert(j);
			return 0;
		}
		for (pair<int, int> j : to_remove) {
			students.erase(students.find(j));
			removed.push_back(j);
		}
	}
	for (pair<int, int> j : removed) students.insert(j);
	return 1;
}

컴파일 시 표준 에러 (stderr) 메시지

teams.cpp: In function 'int can(int, int*)':
teams.cpp:19:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (to_remove.size() == K[i]) break;
        ~~~~~~~~~~~~~~~~~^~~~~~~
teams.cpp:21:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (to_remove.size() != K[i]) {
       ~~~~~~~~~~~~~~~~~^~~~~~~

• Subtask 1: 21 / 21
• Subtask 2: 13 / 13
• Subtask 3: 0 / 43
• Subtask 4: 0 / 23