oj.uz

Submission #204138

# Submission time Handle Problem Language Result Execution time Memory
204138 2020-02-24T14:24:34 Z awlintqaa Teams (IOI15_teams) C++14
34 / 100
 4000 ms 9976 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define C continue
#define mem(dp,x) memset(dp,x,sizeof(dp))
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll>pll;
#include "teams.h"
int n;
pi a[100009];
int done[100009];
void init(int N, int A[], int B[]) {
        n=N;
        for(int i =0 ;i < n;i ++ ){
                a[i]={B[i],A[i]};
        }
        sort(a,a+n);
        for(int i =0 ;i < n;i ++ ){
                swap(a[i].fi,a[i].se);
        }
}
int can(int M, int K[]) {
        mem(done,0);
        sort(K,K+M);
        for(int i =0 ;i < M; i++) {
                int crnt=K[i];
                for(int j =0 ;j <n;j++){
                        if ( done[j])C;
                        if ( a[j].fi<=K[i] && a[j].se>=K[i]){
                                done[j]=1;
                                crnt--;
                        }
                        if ( crnt==0)break;
                }
                if ( crnt > 0 )return 0;
        }
        return 1;
}

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2296 KB Output is correct
2 Correct 22 ms 3448 KB Output is correct
3 Correct 22 ms 3448 KB Output is correct
4 Correct 24 ms 3960 KB Output is correct
5 Correct 29 ms 3064 KB Output is correct
6 Correct 24 ms 3064 KB Output is correct
7 Correct 17 ms 3064 KB Output is correct
8 Correct 17 ms 3068 KB Output is correct
9 Correct 1406 ms 3424 KB Output is correct
10 Correct 520 ms 2936 KB Output is correct
11 Correct 73 ms 2936 KB Output is correct
12 Correct 18 ms 3004 KB Output is correct
13 Correct 19 ms 3192 KB Output is correct
14 Correct 19 ms 3192 KB Output is correct
15 Correct 21 ms 3576 KB Output is correct
16 Correct 20 ms 3452 KB Output is correct
17 Correct 18 ms 3320 KB Output is correct
18 Correct 19 ms 3320 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 2812 KB Output is correct
2 Correct 72 ms 4220 KB Output is correct
3 Execution timed out 4046 ms 4556 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 9976 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -