oj.uz

Submission #787004

# Submission time Handle Problem Language Result Execution time Memory
787004 2023-07-18T16:21:45 Z esomer Teams (IOI15_teams) C++17
34 / 100
 4000 ms 33104 KB 
#include<bits/stdc++.h>
#include "teams.h"

using namespace std;

typedef long long ll;

int n;
vector<vector<int>> start;

void init(int N, int* A, int* B){
	n = N;
	start.resize(n+1);
	for(int i = 0; i < n; i++){
		start[A[i]].push_back(B[i]);
	}
}

int can(int M, int* K){
	vector<int> ev(M);
	for(int i = 0; i < M; i++){
		ev[i] = K[i];
	}
	sort(ev.begin(), ev.end());
	int ind = 0;
	map<int, int> m;
	for(int i = 0; i <= n; i++){
		for(int x : start[i]){
			m[x]++;
		}
		while(ind < M && ev[ind] == i){
			int curr = 0;
			while(curr < ev[ind] && (int)m.size() > 0){
				auto it = m.begin();
				int key = (*it).first;
				int val = (*it).second;
				if(curr + val <= ev[ind]){
					m.erase(key);
					curr += val;
				}else{
					m[key] -= ev[ind] - curr;
					curr = ev[ind];
				}
			}
			if(curr != ev[ind]) return 0;
			ind++;
		}
		m.erase(i);
	}
	return 1;
}

//~ static char buffer[1024];
//~ static int currentChar = 0;
//~ static int charsNumber = 0;

//~ static inline int read() {
  //~ if (charsNumber < 0) {
    //~ exit(1);
  //~ }
  //~ if (!charsNumber || currentChar == charsNumber) {
    //~ charsNumber = (int)fread(buffer, sizeof(buffer[0]), sizeof(buffer), stdin);
    //~ currentChar = 0;
  //~ }
  //~ if (charsNumber <= 0) {
    //~ return -1;
  //~ }
  //~ return buffer[currentChar++];
//~ }

//~ static inline int readInt() {
  //~ int c, x, s;
  //~ c = read();
  //~ while (c <= 32)
    //~ c = read();
  //~ x = 0;
  //~ s = 1;
  //~ if (c == '-') {
    //~ s = -1;
    //~ c = read();
  //~ }
  //~ while (c > 32) {
    //~ x *= 10;
    //~ x += c - '0';
    //~ c = read();
  //~ }
  //~ if (s < 0)
    //~ x = -x;
  //~ return x;
//~ }

//~ int main() {
  //~ freopen("in.txt", "r", stdin);
  //~ int N;
  //~ N = readInt();
  //~ int *A = (int *)malloc(sizeof(int) * (unsigned int)N);
  //~ int *B = (int *)malloc(sizeof(int) * (unsigned int)N);
  //~ for (int i = 0; i < N; ++i) {
    //~ A[i] = readInt();
    //~ B[i] = readInt();
  //~ }
  //~ init(N, A, B);
  //~ int Q;
  //~ Q = readInt();
  //~ for (int i = 0; i < Q; ++i) {
    //~ int M;
    //~ M = readInt();
    //~ int *K = (int *)malloc(sizeof(int) * (unsigned int)M);
    //~ for (int j = 0; j < M; ++j) {
      //~ K[j] = readInt();
    //~ }
    //~ fprintf(stdout, "%d\n", can(M, K));
  //~ }
  //~ return 0;
//}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 280 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 296 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 1 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 5628 KB Output is correct
2 Correct 11 ms 5620 KB Output is correct
3 Correct 32 ms 7168 KB Output is correct
4 Correct 13 ms 6484 KB Output is correct
5 Correct 7 ms 4612 KB Output is correct
6 Correct 6 ms 4564 KB Output is correct
7 Correct 6 ms 4560 KB Output is correct
8 Correct 6 ms 4536 KB Output is correct
9 Correct 7 ms 4632 KB Output is correct
10 Correct 6 ms 4432 KB Output is correct
11 Correct 5 ms 4528 KB Output is correct
12 Correct 7 ms 4576 KB Output is correct
13 Correct 11 ms 4816 KB Output is correct
14 Correct 18 ms 6132 KB Output is correct
15 Correct 29 ms 6904 KB Output is correct
16 Correct 10 ms 5460 KB Output is correct
17 Correct 9 ms 4508 KB Output is correct
18 Correct 9 ms 4552 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 6048 KB Output is correct
2 Correct 16 ms 6132 KB Output is correct
3 Execution timed out 4037 ms 7132 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 26608 KB Output is correct
2 Correct 87 ms 26064 KB Output is correct
3 Execution timed out 4054 ms 33104 KB Time limit exceeded
4 Halted 0 ms 0 KB -