oj.uz

Submission #50648

# Submission time Handle Problem Language Result Execution time Memory
50648 2018-06-12T06:38:37 Z Mamnoon_Siam Teams (IOI15_teams) C++17
21 / 100
 4000 ms 12968 KB 
#include "teams.h"
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>
using namespace std;

#define debug(s) cout<< #s <<" = "<< s <<endl
#define all(v) (v).begin(), (v).end()
#define KeepUnique(v) (v).erase( unique(all(v)), v.end() )
#define MEMSET(a,val) memset(a, val, sizeof a)
#define PB push_back
#define endl '\n'

inline int myrand(int l, int r) {
	int ret = rand(); ret <<= 15; ret ^= rand();
	if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
	return ret;
}
template <typename F, typename S>
ostream& operator << (ostream& os, const pair< F, S>& p) {
    return os<<"(" <<p.first<<", "<<p.second<<")"; }

typedef pair<int, int> ii;
template<typename T> using min_pq =
	priority_queue<T, vector<T>, greater<T> >;

//int dx[] = {-1, +0, +1, +0};
//int dy[] = {+0, +1, +0, -1};

int n;
vector<int> L, R;

void init(int N, int A[], int B[]) {
	L.resize(N);
	R.resize(N);
	n = N;
	for(int i = 0; i < N; i++) {
		L[i] = A[i];
		R[i] = B[i];
	}
	vector<ii> temp;
	for(int i = 0; i < n; i++) {
		temp.push_back(ii(R[i], L[i]));
	}
	sort(all(temp));
	for(int i = 0; i < n; i++) {
		L[i] = temp[i].second;
		R[i] = temp[i].first;
	}
}

int can(int M, int K[]) {
	sort(K, K + M);
	int s = 0;
	for(int i = 0; i < M; i++)
		s += K[i];
	if(s > n) return 0;
	vector<int> ok(n);
	for(int i = 0; i < M; i++) {
		int k = K[i];
		while(k--) {
			int id = -1;
			for(int j = 0; j < n; j++) {
				if(ok[j]) continue;
				if(L[j] <= K[i] and K[i] <= R[j]) {
					id = j;
					break;
				}
			}
			if(id == -1) return 0;
			ok[id] = 1;
		}
	}
	return 1;
}

Compilation message

teams.cpp: In function 'int myrand(int, int)':
teams.cpp:17:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
  ^~
teams.cpp:17:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
                          ^~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 476 KB Output is correct
3 Correct 2 ms 476 KB Output is correct
4 Correct 3 ms 636 KB Output is correct
5 Correct 3 ms 636 KB Output is correct
6 Correct 3 ms 636 KB Output is correct
7 Correct 3 ms 656 KB Output is correct
8 Correct 2 ms 656 KB Output is correct
9 Correct 2 ms 656 KB Output is correct
10 Correct 2 ms 656 KB Output is correct
11 Correct 2 ms 656 KB Output is correct
12 Correct 3 ms 796 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 3 ms 880 KB Output is correct
16 Correct 3 ms 880 KB Output is correct
17 Correct 2 ms 880 KB Output is correct
18 Correct 3 ms 880 KB Output is correct
19 Correct 2 ms 880 KB Output is correct
20 Correct 3 ms 880 KB Output is correct
21 Correct 2 ms 880 KB Output is correct
22 Correct 2 ms 880 KB Output is correct
23 Correct 2 ms 880 KB Output is correct
24 Correct 2 ms 880 KB Output is correct
25 Correct 2 ms 880 KB Output is correct
26 Correct 2 ms 880 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 3504 KB Output is correct
2 Correct 20 ms 3504 KB Output is correct
3 Execution timed out 4021 ms 3504 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 3504 KB Output is correct
2 Correct 155 ms 3504 KB Output is correct
3 Execution timed out 4011 ms 3504 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 879 ms 12968 KB Output is correct
2 Correct 1080 ms 12968 KB Output is correct
3 Execution timed out 4038 ms 12968 KB Time limit exceeded
4 Halted 0 ms 0 KB -