oj.uz

Submission #313203

# Submission time Handle Problem Language Result Execution time Memory
313203 2020-10-15T13:42:28 Z AmineWeslati Teams (IOI15_teams) C++14
34 / 100
 4000 ms 17224 KB 
//Never stop trying
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x,y) cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << " - " << #v << " : " << endl << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;

void IO() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
}

int N; 
int l[MX],r[MX];
multiset<pi> ss;

void init(int NN, int AA[], int BB[]){
	N=NN; FOR(i,0,N) l[i]=AA[i],r[i]=BB[i];
	FOR(i,0,N) ss.insert({l[i],r[i]});
}


int can(int M, int k[]){
	vi a;
	FOR(i,0,M) a.pb(k[i]);
	sort(all(a));

	/*ll S=0;
	for(auto x: a) S+=x; 
	if(x>N) return 0;*/

	multiset<pi> s,s1,s2;
	for(auto x: ss){
		s.insert({x.se,x.fi});
		s1.insert(x);
	}

	FOR(i,0,M){
		while(!s.empty() && (*s.begin()).fi<a[i]){
			pi p=(*s.begin());
			s.erase(s.begin());
			if(s1.count({p.se,p.fi})>0) s1.erase(s1.find({p.se,p.fi}));
			if(s2.count(p)>0) s2.erase(s2.find(p));
		}

		while(!s1.empty() && (*s1.begin()).fi<=a[i]){
			pi p=(*s1.begin());
			s1.erase(s1.begin());
			s2.insert({p.se,p.fi});
		}
		//cout << a[i] << ' ' << sz(s2) << endl;
		if(sz(s2)<a[i]) return 0;
		int X=a[i];
		while(X--){
			pi p=(*s2.begin());
			s2.erase(s2.begin());
			//s1.erase(s1.find({p.se,p.fi}));
			s.erase(s.find(p));
		}
	}

	return 1;
}


/* Careful!!!
	.Array bounds
	.Infinite loops
	.Uninitialized variables / empty containers
	.Order of input

   Some insights:
	.Binary search
	.Graph representation
	.Write brute force code
	.Change your approach
*/

Compilation message

teams.cpp: In function 'void IO()':
teams.cpp:47:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   47 |  freopen("input.txt", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
teams.cpp:48:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   48 |  freopen("output.txt", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 4 ms 288 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 16248 KB Output is correct
2 Correct 153 ms 16120 KB Output is correct
3 Correct 198 ms 16120 KB Output is correct
4 Correct 162 ms 16884 KB Output is correct
5 Correct 127 ms 16120 KB Output is correct
6 Correct 168 ms 16124 KB Output is correct
7 Correct 103 ms 16120 KB Output is correct
8 Correct 114 ms 16120 KB Output is correct
9 Correct 129 ms 16376 KB Output is correct
10 Correct 109 ms 16632 KB Output is correct
11 Correct 101 ms 16656 KB Output is correct
12 Correct 106 ms 16804 KB Output is correct
13 Correct 128 ms 16888 KB Output is correct
14 Correct 121 ms 16888 KB Output is correct
15 Correct 146 ms 17224 KB Output is correct
16 Correct 156 ms 17144 KB Output is correct
17 Correct 436 ms 17144 KB Output is correct
18 Correct 121 ms 17016 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4067 ms 16376 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 39 ms 11640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -