oj.uz

Submission #603981

# Submission time Handle Problem Language Result Execution time Memory
603981 2022-07-24T14:26:42 Z PanTkd Teams (IOI15_teams) C++17
34 / 100
 4000 ms 154188 KB 
//
//  main.cpp
//
//  Created by Panagiotis Chadjicostas on
//  Copyright © Panagiotis Hadjicostas. All rights reserved.
//
#include "teams.h"
#include <iostream>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iterator>
#include <limits>
#include <list>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <unordered_map>

using namespace std;

typedef int ll;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
#define fo(i,a,b) for(int i = a; i<=b; i++)
#define f(i,b) for(int i=0;i<b;i++)
#define F first
#define S second
#define sz size
#define ls s,m,idx<<1
#define rs m+1,e,idx<<1|1
const ll MOD=ll(1e9)+7;
const ll MAXN=2*ll(1e6);
void checker(){
    ll n=rand()%20+2;
    vi a(n,ll());
    for(ll i=0;i<n;i++){
        a[i]=rand()%20+2;
    }
    for(ll b=0;b<(1<<n);b++){
        vi on,off;
        for(ll i=0;i<n;i++){
            if(i&(1<<i)){
                on.push_back(i);
            }
            else{
                off.push_back(i);
            }
        }
    }
}
///////////////////////////////////////////////////////////////////////
vector<pair<ll,ll> > V;
vector<vi> v;
bool cmp(ii a,ii b){
    if(a.F<b.F)
        return 1;
    else if(b.F<a.F)
        return 0;
    else if(a.S<b.S)
        return 1;
    else
        return 0;
}
void init(int N, int A[], int B[]){
    v.assign(5000001,vi());
    for(ll i=0;i<N;i++){
        v[A[i]].push_back(B[i]);
    }
}

int can(int M, int K[]){
    sort(K,K+M);
    multiset<ll> ms;

    ll idx=0;
    for(ll i=0;i<M;i++){
        while(idx <= K[i]) {
            for(auto z : v[idx])
                ms.insert(z);
            idx++;
        }
        ll temp=K[i];
        while(temp && (int)ms.size() > 0) {
            if(*ms.begin() >= K[i])
                temp--;
            ms.erase(ms.begin());
        }
        if(temp>0)
            return 0;
    }
    return 1;
}

/*
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll N;cin>>N;
    ll A[N],B[N];
    for(ll i=0;i<N;i++)
        cin>>A[i]>>B[i];
    init(N,A,B);
    ll Q;cin>>Q;

    while(Q--){
        ll M;cin>>M;
        ll K[M];
        for(ll i=0;i<M;i++)
            cin>>K[i];
        cout<<can(M,K)<<endl;
    }
    return 0;
}
*/

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 117588 KB Output is correct
2 Correct 61 ms 117676 KB Output is correct
3 Correct 62 ms 117664 KB Output is correct
4 Correct 62 ms 117668 KB Output is correct
5 Correct 66 ms 117648 KB Output is correct
6 Correct 62 ms 117688 KB Output is correct
7 Correct 62 ms 117708 KB Output is correct
8 Correct 63 ms 117680 KB Output is correct
9 Correct 62 ms 117704 KB Output is correct
10 Correct 64 ms 117688 KB Output is correct
11 Correct 65 ms 117632 KB Output is correct
12 Correct 63 ms 117716 KB Output is correct
13 Correct 62 ms 117656 KB Output is correct
14 Correct 62 ms 117724 KB Output is correct
15 Correct 64 ms 117644 KB Output is correct
16 Correct 62 ms 117684 KB Output is correct
17 Correct 71 ms 117632 KB Output is correct
18 Correct 64 ms 117716 KB Output is correct
19 Correct 61 ms 117680 KB Output is correct
20 Correct 62 ms 117600 KB Output is correct
21 Correct 62 ms 117592 KB Output is correct
22 Correct 75 ms 117652 KB Output is correct
23 Correct 64 ms 117600 KB Output is correct
24 Correct 61 ms 117620 KB Output is correct
25 Correct 61 ms 117704 KB Output is correct
26 Correct 63 ms 117600 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 120272 KB Output is correct
2 Correct 77 ms 120268 KB Output is correct
3 Correct 103 ms 124652 KB Output is correct
4 Correct 77 ms 120628 KB Output is correct
5 Correct 84 ms 119112 KB Output is correct
6 Correct 86 ms 119140 KB Output is correct
7 Correct 66 ms 119236 KB Output is correct
8 Correct 67 ms 119200 KB Output is correct
9 Correct 86 ms 123608 KB Output is correct
10 Correct 85 ms 123792 KB Output is correct
11 Correct 91 ms 123720 KB Output is correct
12 Correct 86 ms 123476 KB Output is correct
13 Correct 84 ms 122152 KB Output is correct
14 Correct 90 ms 124368 KB Output is correct
15 Correct 76 ms 120820 KB Output is correct
16 Correct 72 ms 120404 KB Output is correct
17 Correct 92 ms 120628 KB Output is correct
18 Correct 87 ms 120556 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 120564 KB Output is correct
2 Correct 80 ms 120692 KB Output is correct
3 Execution timed out 4078 ms 124988 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 131532 KB Output is correct
2 Correct 181 ms 131300 KB Output is correct
3 Execution timed out 4072 ms 154188 KB Time limit exceeded
4 Halted 0 ms 0 KB -