oj.uz

Submission #290992

# Submission time Handle Problem Language Result Execution time Memory
290992 2020-09-04T15:17:22 Z arayi Teams (IOI15_teams) C++17
34 / 100
 4000 ms 16632 KB 
#include <bits/stdc++.h>
#include "teams.h"
#define ad push_back
using namespace std;
const int N = 1e5 + 30;
int l[N], r[N], n;
vector <int> fp[N];
void init(int N, int A[], int B[])
{
    n = N;
    for (int i = 0; i < n; i++)
    {
        l[i] = A[i];
        r[i] = B[i];
        fp[l[i]].ad(r[i]);
    }
}
int col[N];
int can(int m, int k[])
{
    for (int i = 0; i <= n; i++) col[i] = 0;
    //cout << "SM" << endl;
	for (int i = 0; i < m; i++) col[k[i]] += k[i];
	//cout << "SM" << endl;
	priority_queue <int, vector<int>, greater<int> > q;
	//cout << "SM" << endl;
	for (int i = 1; i <= n; i++)
	{
	    //cout << "SM" << endl;
	    for(auto p : fp[i]) q.push(p);
	    while(!q.empty() && q.top() < i) q.pop();
	    if(q.size() < col[i]) return 0;
	    while(col[i]--) q.pop();
	}
	return 1;
}

Compilation message

teams.cpp: In function 'void init(int, int*, int*)':
teams.cpp:8:34: warning: declaration of 'N' shadows a global declaration [-Wshadow]
    8 | void init(int N, int A[], int B[])
      |                                  ^
teams.cpp:5:11: note: shadowed declaration is here
    5 | const int N = 1e5 + 30;
      |           ^
teams.cpp: In function 'int can(int, int*)':
teams.cpp:32:18: 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]
   32 |      if(q.size() < col[i]) return 0;
      |         ~~~~~~~~~^~~~~~~~

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 7552 KB Output is correct
2 Correct 26 ms 7424 KB Output is correct
3 Correct 32 ms 7800 KB Output is correct
4 Correct 21 ms 7800 KB Output is correct
5 Correct 10 ms 6016 KB Output is correct
6 Correct 12 ms 6016 KB Output is correct
7 Correct 8 ms 6016 KB Output is correct
8 Correct 9 ms 6016 KB Output is correct
9 Correct 13 ms 6776 KB Output is correct
10 Correct 11 ms 6392 KB Output is correct
11 Correct 11 ms 6392 KB Output is correct
12 Correct 12 ms 6520 KB Output is correct
13 Correct 18 ms 6652 KB Output is correct
14 Correct 21 ms 7416 KB Output is correct
15 Correct 36 ms 7672 KB Output is correct
16 Correct 20 ms 7296 KB Output is correct
17 Correct 18 ms 6400 KB Output is correct
18 Correct 19 ms 6400 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 8312 KB Output is correct
2 Correct 34 ms 7800 KB Output is correct
3 Execution timed out 4058 ms 8124 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 43 ms 16632 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -