oj.uz

Submission #786726

# Submission time Handle Problem Language Result Execution time Memory
786726 2023-07-18T11:57:19 Z vnm06 Teams (IOI15_teams) C++14
34 / 100
 4000 ms 10060 KB 
#include "teams.h"
#include<bits/stdc++.h>
using namespace std;

struct uchenik
{
    int le, ri;
    uchenik() {}
    uchenik(int a, int b)
    {
        le=a;
        ri=b;
    }
};

bool operator<(uchenik a, uchenik b)
{
    if(a.le==b.le) return a.ri<b.ri;
    return a.le<b.le;
}

int n;
uchenik t[100005];

void init(int N, int A[], int B[])
{
    n=N;
    for(int i=0; i<n; i++) t[i].le=A[i], t[i].ri=B[i];
    sort(t, t+n);
}

multiset<int> st;

int can(int M, int K[])
{
    st.clear();
    int id=0;
    sort(K, K+M);
    for(int i=0; i<M; i++)
    {
        while(id<n && t[id].le<=K[i])
        {
            st.insert(t[id].ri);
            id++;
        }
        while(!st.empty() && (*st.begin())<K[i]) st.erase(st.begin());
        if(st.size()<K[i]) return 0;
        for(int j=0; j<K[i]; j++) st.erase(st.begin());
    }
	return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:47:21: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   47 |         if(st.size()<K[i]) return 0;
      |            ~~~~~~~~~^~~~~

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 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 308 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 312 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1876 KB Output is correct
2 Correct 12 ms 1884 KB Output is correct
3 Correct 35 ms 6100 KB Output is correct
4 Correct 15 ms 2260 KB Output is correct
5 Correct 14 ms 1892 KB Output is correct
6 Correct 15 ms 2752 KB Output is correct
7 Correct 9 ms 2644 KB Output is correct
8 Correct 9 ms 2652 KB Output is correct
9 Correct 23 ms 7416 KB Output is correct
10 Correct 21 ms 7056 KB Output is correct
11 Correct 21 ms 7152 KB Output is correct
12 Correct 22 ms 6908 KB Output is correct
13 Correct 27 ms 5516 KB Output is correct
14 Correct 25 ms 7500 KB Output is correct
15 Correct 14 ms 3540 KB Output is correct
16 Correct 12 ms 2940 KB Output is correct
17 Correct 19 ms 4236 KB Output is correct
18 Correct 20 ms 4152 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2252 KB Output is correct
2 Correct 17 ms 2184 KB Output is correct
3 Execution timed out 4077 ms 6568 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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