oj.uz

Submission #937563

# Submission time Handle Problem Language Result Execution time Memory
937563 2024-03-04T08:36:43 Z danikoynov Teams (IOI15_teams) C++14
34 / 100
 4000 ms 32784 KB 
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 10;

struct segment
{
    int l, r;

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

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]);
}

struct event
{
    int x, t, id;

    event(int _x = 0, int _t = 0, int _id = 0)
    {
        x = _x;
        t = _t;
        id = _id;
    }

};

bool cmp_event(event e1, event e2)
{
    if (e1.x != e2.x)
        return e1.x < e2.x;
    return e1.t < e2.t;
}

int can(int M, int K[])
{
    vector < event > events;
    for (int i = 0; i < M; i ++)
    {
        events.push_back(event(K[i], 0, -1));
    }
    for (int i = 1; i <= n; i ++)
    {
        events.push_back(event(s[i].l, -1, i));
        events.push_back(event(s[i].r, 1, i));
    }

    sort(events.begin(), events.end(), cmp_event);

    set < pair < int, int > > act;
    for (event cur : events)
    {
        if (cur.t == -1)
        {
            act.insert({s[cur.id].r, cur.id});
        }
        else
        if (cur.t == 1)
        {
            if (act.find({s[cur.id].r, cur.id}) != act.end())
                act.erase({s[cur.id].r, cur.id});
        }
        else
        {
            if (act.size() < cur.x)
            {
                return 0;
            }
            for (int d = 0; d < cur.x; d ++)
                act.erase(act.begin());
        }
    }
    return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:76:28: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   76 |             if (act.size() < cur.x)
      |                 ~~~~~~~~~~~^~~~~~~

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 8144 KB Output is correct
2 Correct 28 ms 8148 KB Output is correct
3 Correct 58 ms 9664 KB Output is correct
4 Correct 35 ms 14540 KB Output is correct
5 Correct 34 ms 10196 KB Output is correct
6 Correct 38 ms 8912 KB Output is correct
7 Correct 22 ms 10196 KB Output is correct
8 Correct 22 ms 8916 KB Output is correct
9 Correct 33 ms 13448 KB Output is correct
10 Correct 31 ms 12736 KB Output is correct
11 Correct 29 ms 12996 KB Output is correct
12 Correct 31 ms 12492 KB Output is correct
13 Correct 43 ms 11392 KB Output is correct
14 Correct 46 ms 13000 KB Output is correct
15 Correct 58 ms 10688 KB Output is correct
16 Correct 28 ms 9292 KB Output is correct
17 Correct 40 ms 10704 KB Output is correct
18 Correct 40 ms 10056 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4046 ms 11692 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4051 ms 32784 KB Time limit exceeded
2 Halted 0 ms 0 KB -