제출 #929007

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
929007		GrindMachine	팀들 (IOI15_teams)	C++17	0 / 100	4049 ms	16820 KiB

teams

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
edi

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "teams.h"

int n;
vector<int> a(N);
vector<int> b(N);

void init(int n_, int A[], int B[]) {
	n = n_;
	rep(i,n) a[i] = A[i], b[i] = B[i];
}

int can(int m, int K[]) {
	int sum = 0;
	rep(i,m){
		sum += K[i];
		if(sum > n){
			return 0;
		}
	}

	sort(K,K+m);
	vector<pii> c;
	c.pb({K[0],K[0]});
	rep1(i,m-1){
		if(K[i] == K[i-1]){
			c.back().ss += K[i];
		}
		else{
			c.pb({K[i],K[i]});
		}
	}

	auto get = [&](int mnl, int mxl, int mnr){
		int cnt = 0;
		rep(i,n){
			if(a[i] >= mnl and a[i] <= mxl and b[i] >= mnr){
				cnt++;
			}
		}
		return cnt;
	};

	m = sz(c);
	rep(l,m){
		int val = get(1,c[l].ff,c[l].ff)-c[l].ss;
		if(val < 0){
			return 0;
		}
		for(int r = l+1; r < m; ++r){
			val += get(c[r-1].ff+1,c[r].ff,c[r].ff);
			val -= c[r].ss;
			if(val < 0){
				return 0;
			}
		}
	}

	return 1;
}

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