Submission #820159

#	Time	Username	Problem	Language	Result	Execution time	Memory
820159		tolbi	Teams (IOI15_teams)	C++17	34 / 100	4065 ms	20088 KiB

teams

#pragma optimize("Bismillahirrahmanirrahim");
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
//Sani buyuk Osman Pasa Plevneden cikmam diyor
#define author tolbi
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream& operator>>(istream& is, vector<T> &v){for (auto &it : v) is>>it;return is;}
template<typename T, size_t Y> istream& operator>>(istream& is, array<T,Y> &v){for (auto &it : v) is>>it;return is;}
template<typename T> ostream& operator<<(ostream& os, vector<T> &v){for (auto &it : v) os<<it<<" ";return os;}
template<typename T, size_t Y> ostream& operator<<(ostream& os, array<T,Y> &v){for (auto &it : v) os<<it<<" ";return os;}
template<typename X, typename Y> istream& operator>>(istream& is, pair<X,Y> &pr){return is<<pr.first<<" "<<pr.second;}
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> &pr){return os>>pr.first>>pr.second;}
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define vint(x) vector<int> x
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(), x.end())
#define sortrarr(x) sort(x.rbegin(), x.rend())
#define rev(x) reverse(x.begin(), x.end())
#define endl '\n'
#define tol(bi) (1LL<<((int)(bi)))
typedef long long ll;
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "teams.h"
vector<pair<int,int>> arr;
void init(int N, int A[], int B[]) {
	arr.resize(N);
	for (int i = 0; i < N; i++){
		arr.push_back({A[i],B[i]});
	}
	sortarr(arr);
}

int can(int m, int k[]) {
	sort(k, k+m);
	priority_queue<int,vector<int>,greater<int>> pq;
	int indi = 0;
	for (int i = 0; i < m; i++){
		while (indi<arr.size() && arr[indi].first<=k[i]){
			pq.push(arr[indi++].second);
		}
		while (pq.size() && pq.top()<k[i]) pq.pop();
		if (pq.size()<k[i]) return 0;
		for (int j = 0; j < k[i]; j++){
			pq.pop();
		}
	}
	return 1;
}

Compilation message (stderr)

teams.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim");
      | 
teams.cpp: In function 'int can(int, int*)':
teams.cpp:48:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |   while (indi<arr.size() && arr[indi].first<=k[i]){
      |          ~~~~^~~~~~~~~~~
teams.cpp:52:16: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int, std::vector<int>, std::greater<int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   52 |   if (pq.size()<k[i]) return 0;
      |       ~~~~~~~~~^~~~~

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