제출 #1242470

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1242470		tkm_algorithms	팀들 (IOI15_teams)	C++20	0 / 100	4094 ms	15912 KiB

teams

/**
*    In the name of Allah
*    We are nothing and you're everything
*    Ya Muhammad!
**/
#include <bits/stdc++.h>
#include "teams.h"
 
using namespace std;
using ll = long long;
using ull = uint64_t;
 
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
//#define int long long

vector<pair<int, int>> a;

void init(int n, int A[], int B[]) {
	a.clear();
	for (int i = 0; i < n; ++i)a.push_back({A[i], B[i]});
}

int can(int m, int K[]) {
	vector<pair<int, int>> onki = a;
	vector<int> k(m);
	for (int i = 0; i < m; ++i)k[i] = K[i];
	sort(all(k));
	//vector<int>::iterator ip;
	//ip = unique(all(k));
	//k.resize(distance(k.begin(), ip));
	
	for (auto i: k) {
		vector<pair<int, int>> c;
		for (auto j: a) {
			if (j.first <= i && j.second >= i)c.push_back({j.second, j.first});
		}
		if (sz(c) < i)return 0;
		sort(all(c));
		for (int j = 0; j < i; ++j) {
			a.erase(find(all(a), make_pair(c[j].second, c[j].first)));
		}
	}
	a = onki;
	return 1;
}

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