oj.uz

Submission #67867

# Submission time Handle Problem Language Result Execution time Memory
67867 2018-08-15T11:32:35 Z theknife2001 Teams (IOI15_teams) C++17
34 / 100
 4000 ms 20272 KB 
#include "teams.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
#define ii pair < int , int>
#define se second
#define fi first


using namespace std;
const int N=1e5+55;
ii a[N];
int b[N];
int n;
priority_queue< int , vector < int > , greater < int > > pq;


void init(int N, int A[], int B[])
{
    n=N;
    for(int i=0;i<n;i++)
        a[i]={A[i],B[i]};
    sort(a,a+n);
}

int can(int M, int K[])
{
    for(int i=0;i<=n;i++)
        b[i]=0;
    for(int i=0;i<M;i++)
    {
        b[K[i]]++;
    }
    int j=0;
    for(int i=1;i<=n;i++)
    {
        while(j<n&&a[j].fi<=i)
            pq.push(a[j++].se);
        while(pq.size()&&pq.top()<i)
            pq.pop();
        int x=b[i]*i;
        while(x>0)
        {
            if(pq.size()==0)
                return 0;
            pq.pop();
            x--;
        }
    }
    while(pq.size())
        pq.pop();
	return 1;
}

Compilation message

teams.cpp: In function 'void init(int, int*, int*)':
teams.cpp:17:34: warning: declaration of 'N' shadows a global declaration [-Wshadow]
 void init(int N, int A[], int B[])
                                  ^
teams.cpp:10:11: note: shadowed declaration is here
 const int N=1e5+55;
           ^
teams.cpp: In function 'int can(int, int*)':
teams.cpp:49:5: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
     while(pq.size())
     ^~~~~
teams.cpp:51:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
  return 1;
  ^~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 3 ms 560 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 3 ms 560 KB Output is correct
6 Correct 4 ms 560 KB Output is correct
7 Correct 3 ms 560 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 2 ms 624 KB Output is correct
10 Correct 4 ms 756 KB Output is correct
11 Correct 2 ms 920 KB Output is correct
12 Correct 3 ms 920 KB Output is correct
13 Correct 3 ms 920 KB Output is correct
14 Correct 3 ms 920 KB Output is correct
15 Correct 3 ms 920 KB Output is correct
16 Correct 2 ms 920 KB Output is correct
17 Correct 2 ms 920 KB Output is correct
18 Correct 2 ms 920 KB Output is correct
19 Correct 2 ms 920 KB Output is correct
20 Correct 2 ms 920 KB Output is correct
21 Correct 2 ms 920 KB Output is correct
22 Correct 2 ms 924 KB Output is correct
23 Correct 3 ms 928 KB Output is correct
24 Correct 3 ms 932 KB Output is correct
25 Correct 2 ms 936 KB Output is correct
26 Correct 2 ms 956 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2884 KB Output is correct
2 Correct 21 ms 2884 KB Output is correct
3 Correct 35 ms 3264 KB Output is correct
4 Correct 21 ms 3268 KB Output is correct
5 Correct 17 ms 3268 KB Output is correct
6 Correct 20 ms 3268 KB Output is correct
7 Correct 15 ms 3268 KB Output is correct
8 Correct 16 ms 3652 KB Output is correct
9 Correct 19 ms 5320 KB Output is correct
10 Correct 17 ms 5800 KB Output is correct
11 Correct 14 ms 6312 KB Output is correct
12 Correct 15 ms 7016 KB Output is correct
13 Correct 27 ms 7632 KB Output is correct
14 Correct 34 ms 8892 KB Output is correct
15 Correct 38 ms 9756 KB Output is correct
16 Correct 22 ms 10512 KB Output is correct
17 Correct 24 ms 11820 KB Output is correct
18 Correct 23 ms 12904 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 13104 KB Output is correct
2 Correct 50 ms 13104 KB Output is correct
3 Execution timed out 4019 ms 13104 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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