oj.uz

Submission #937891

# Submission time Handle Problem Language Result Execution time Memory
937891 2024-03-04T16:06:39 Z danikoynov Teams (IOI15_teams) C++14
21 / 100
 4000 ms 10836 KB 
#include "teams.h"

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

struct segment
{
    int l, r;

    segment(int _l = 0, int _r = 0)
    {
        l = _l;
        r = _r;
    }
};

const int maxn = 5e5 + 10;

int n;
segment s[maxn];
void init(int N, int A[], int B[])
{
    n = N;
    for (int i = 1; i <= n; i ++)
    {
        s[i] = segment(A[i - 1], B[i - 1]);
    }
}


int zeta(int a, int b)
{
    int cnt = 0;
    for (int i = 1; i <= n; i ++)
    {
        if (s[i].l <= a && s[i].r >= a)
            continue;
        if (s[i].l <= b && s[i].r >= b)
            cnt ++;
    }
    return cnt;
}

int dp[maxn];
int can(int M, int K[])
{
    sort(K, K + M);

    for (int i = 0; i < M; i ++)
    {
        dp[i] = zeta(0, K[i]) - K[i];
        for (int j = 0; j < i; j ++)
        {
            dp[i] = min(dp[i], dp[j] + zeta(K[j], K[i]) - K[i]);
        }
        if (dp[i] < 0)
            return 0;
    }
    return 1;
}

Subtask #1
21.0 / 21.0

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

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6748 KB Output is correct
2 Correct 6 ms 6924 KB Output is correct
3 Correct 6 ms 6904 KB Output is correct
4 Correct 8 ms 7260 KB Output is correct
5 Execution timed out 4053 ms 6748 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 7252 KB Output is correct
2 Correct 221 ms 7512 KB Output is correct
3 Execution timed out 4040 ms 7760 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 965 ms 10796 KB Output is correct
2 Correct 968 ms 10836 KB Output is correct
3 Execution timed out 4048 ms 10576 KB Time limit exceeded
4 Halted 0 ms 0 KB -