oj.uz

Submission #751905

# Submission time Handle Problem Language Result Execution time Memory
751905 2023-06-01T18:39:28 Z Seb Teams (IOI15_teams) C++17
21 / 100
 34 ms 15128 KB 
#include "teams.h"
#include <bits/stdc++.h>

using namespace std;

#define f first
#define s second

typedef long long ll;

const ll MAXN = 2e2+5;

ll n,cnt[MAXN];
pair <ll,ll> p[MAXN];
bool flag[MAXN];

void init(int N, int A[], int B[]) {
    n = N;
    for (int i=0;i<N;i++) p[i] = {A[i],B[i]};
    sort(p,p+N,[&] (pair<ll,ll> a, pair<ll,ll> b) {return a.s < b.s;});
    return;
}

int can(int M, int K[]) {
    for (int i=0;i<MAXN;i++) {
        flag[i] = false;
        cnt[i] = 0;
    }
    sort(K,K+M);
    for (int j=0;j<M;j++) for (int i=0;i<n;i++) if (flag[i]==false && p[i].f<=K[j] && p[i].s>=K[j]) {
        flag[i] = true;
        cnt[j]++;
        if (cnt[j]==K[j]) break;
    }
    for (int i=0;i<M;i++) if (cnt[i]!=K[i]) return 0;
	return 1;
}

Subtask #1
21.0 / 21.0

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

Subtask #2
0 / 13.0

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

Subtask #3
0 / 43.0

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

Subtask #4
0 / 23.0

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