oj.uz

Submission #488459

# Submission time Handle Problem Language Result Execution time Memory
488459 2021-11-19T05:34:09 Z blue Teams (IOI15_teams) C++17
34 / 100
 4000 ms 14896 KB 
#include "teams.h"
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <iostream>
using namespace std;

using pii = pair<int, int>;
using vpii = vector<pii>;
using vi = vector<int>;

int N;
vpii PG;

void init(int N_, int A[], int B[])
{
    N = N_;
    for(int i = 0; i < N; i++) PG.push_back({A[i], B[i]});

    sort(PG.begin(), PG.end(), [] (pii p, pii q)
    {
        return p.second < q.second;
    });
}

int can(int M, int K[])
{
    sort(K, K+M);
    vpii P = PG;

    vi done(M, 0);

    int i = 0;

    vi used(N, 0);

    for(int t = 0; t < M; t++)
    {
        // cerr << "t = " << t << '\n';
        for(int i = 0; i < N; i++)
        {
            if(done[t] == K[t]) break;

            if(used[i]) continue;

            // cerr << i << ' ' << used[i] << '\n';

            if(!(P[i].first <= K[t] && K[t] <= P[i].second)) continue;
            // cerr << "? " << P[i].first << ' ' << K[t] << ' ' << P[i].second << "\n";

            done[t]++;
            used[i]++;
        }
        if(done[t] != K[t]) return 0;
    }

	return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:41:17: warning: declaration of 'i' shadows a previous local [-Wshadow]
   41 |         for(int i = 0; i < N; i++)
      |                 ^
teams.cpp:34:9: note: shadowed declaration is here
   34 |     int i = 0;
      |         ^
teams.cpp:34:9: warning: unused variable 'i' [-Wunused-variable]

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2948 KB Output is correct
2 Correct 16 ms 3024 KB Output is correct
3 Correct 18 ms 3024 KB Output is correct
4 Correct 16 ms 3796 KB Output is correct
5 Correct 21 ms 3048 KB Output is correct
6 Correct 17 ms 2928 KB Output is correct
7 Correct 10 ms 3028 KB Output is correct
8 Correct 10 ms 2932 KB Output is correct
9 Correct 852 ms 3388 KB Output is correct
10 Correct 349 ms 3176 KB Output is correct
11 Correct 43 ms 3660 KB Output is correct
12 Correct 11 ms 3652 KB Output is correct
13 Correct 12 ms 3928 KB Output is correct
14 Correct 11 ms 3912 KB Output is correct
15 Correct 14 ms 4164 KB Output is correct
16 Correct 14 ms 4156 KB Output is correct
17 Correct 11 ms 4132 KB Output is correct
18 Correct 12 ms 4072 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 3512 KB Output is correct
2 Correct 122 ms 3304 KB Output is correct
3 Execution timed out 4046 ms 3700 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 435 ms 14748 KB Output is correct
2 Correct 520 ms 14896 KB Output is correct
3 Execution timed out 4091 ms 14064 KB Time limit exceeded
4 Halted 0 ms 0 KB -