oj.uz

Submission #772409

# Submission time Handle Problem Language Result Execution time Memory
772409 2023-07-04T05:44:09 Z Magikarp4000 Teams (IOI15_teams) C++17
34 / 100
 4000 ms 8968 KB 
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

const int MAXN = 1e5+5;
int n,m;
vector<PII> v;

bool cmp(const PII &x, const PII &y) {
    if (x.S == y.S) return x.F < y.F;
    return x.S < y.S;
}

void init(int N, int A[], int B[]) {
    n = N;
    FOR(i,0,n) v.PB({A[i],B[i]});
    sort(ALL(v),cmp);
}

int can(int M, int K[]) {
	m = M;
    multiset<PII> s;
    FOR(i,0,m) s.insert({K[i],K[i]});
    FOR(i,0,n) {
        if (s.empty()) return 1;
        auto it = s.lower_bound({v[i].F,0});
        if (it == s.end()) continue;
        PII cur = *it;
        if (cur.F <= v[i].S) {
            s.erase(it);
            if (cur.S-1 > 0) s.insert({cur.F,cur.S-1});
        }
    }
    return s.empty();
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 724 KB Output is correct
7 Correct 1 ms 212 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 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 2124 KB Output is correct
2 Correct 16 ms 2124 KB Output is correct
3 Correct 19 ms 2252 KB Output is correct
4 Correct 39 ms 6904 KB Output is correct
5 Correct 18 ms 2252 KB Output is correct
6 Correct 15 ms 2124 KB Output is correct
7 Correct 16 ms 2184 KB Output is correct
8 Correct 16 ms 2124 KB Output is correct
9 Correct 18 ms 3492 KB Output is correct
10 Correct 15 ms 2760 KB Output is correct
11 Correct 12 ms 2124 KB Output is correct
12 Correct 12 ms 2252 KB Output is correct
13 Correct 17 ms 2228 KB Output is correct
14 Correct 16 ms 2252 KB Output is correct
15 Correct 15 ms 2252 KB Output is correct
16 Correct 16 ms 2124 KB Output is correct
17 Correct 15 ms 2252 KB Output is correct
18 Correct 15 ms 2132 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 206 ms 2252 KB Output is correct
2 Correct 253 ms 2252 KB Output is correct
3 Execution timed out 4069 ms 2124 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 880 ms 8968 KB Output is correct
2 Correct 1012 ms 8944 KB Output is correct
3 Execution timed out 4062 ms 8388 KB Time limit exceeded
4 Halted 0 ms 0 KB -