Submission #1184965

#	Time	Username	Problem	Language	Result	Execution time	Memory
1184965		sano	Teams (IOI15_teams)	C++20	0 / 100	739 ms	589824 KiB

teams

//#pragma GCC optimize("O3")
//#pragma GCC target("tune=native")
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include "teams.h"
#include<iostream>
#include<vector>
#include<queue>
#include<deque>
#include<string>
#include<fstream>
#include<algorithm>
#include <iomanip>
#include<map>
#include <set>
#include <unordered_map>
#include <stack>
#include <unordered_set>
#include <cmath>
#include <cstdint>
#include <cassert>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#define shit short int
#define ll long long
//#define int ll
#define For(i, n) for(int i = 0; i < (int)n; i++)
#define ffor(i, a, n) for(int i = (int)a; i < (int)n; i++)
#define rfor(i, n) for(int i = (int)n; i >= (int)0; i--)
#define rffor(i, a, n) for(int i = (int)n; i >= (int)a; i--)
#define vec vector
#define ff first
#define ss second
#define pb push_back
#define pii pair<int, int>
#define NEK 2000000000
#define mod 1000000007
#define mod2 1000000009
#define rsz resize
#define prv1 47
#define prv2 43
#define D 8
#define trav(a,x) for (auto& a: x)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define all(x) (x).begin(), (x).end()
#define sig 0.0000001

using namespace std;
//using namespace __gnu_pbds;

//template <typename T1, typename T2>
//using indexed_set = tree<pair<T1, T2>, null_type, less<pair<T1, T2>>, rb_tree_tag, tree_order_statistics_node_update>;

int a[100000];
int b[100000];
int n;

void init(int n2, int a2[], int b2[]) {
	n = n2;
	vec<pii> p;
	For(i, n) {
		p.push_back({ a2[i], b2[i] });
	}
	sort(all(p));
	For(i, n) a[i] = p[i].ff, b[i] = p[i].ss;

	return;
}

int can(int m, int k[]) {
	priority_queue<int> q;
	int som = 0;
	For(i, m) {
		while (som < m && a[som] <= k[i]) {
			q.push(b[som] * (-1));
		}
		while (!q.empty() && (q.top() * (-1)) < k[i]) {
			q.pop();
		}
		For(j, k[i]) {
			if (!q.empty()) return 0;
			q.pop();
		}
	}
	return 1;
}

/*
signed main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	int t; t = 1;
	init(t);
	spravne = { 1, 2, 3, 4, 5, 6 };
	while(1) {
		orderCoins();
		if (!next_permutation(all(spravne))) break;
	}
	return 0;
}*/

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