oj.uz

Submission #971851

# Submission time Handle Problem Language Result Execution time Memory
971851 2024-04-29T11:56:00 Z VinhLuu Teams (IOI15_teams) C++17
34 / 100
 4000 ms 19484 KB 
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(lmao) lmao.begin(), lmao.end()

using namespace std;

typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
const int N = 1e6 + 5;
int block = 555;
const int mod = 1e9 + 7;
//const ll oo = 5e18;

int n;
vector<pii> vr;

void init(int _n, int A[], int B[]){
    n = _n;
    for(int i = 0; i < n; i ++){
        vr.pb({A[i], B[i]});
    }
    sort(all(vr), [&](pii x,pii y){return x.fi < y.fi;});
}

int can(int m,int k[]){
    int ptr = -1;
    vector<int> K;
    for(int i = 0; i < m; i ++) K.pb(k[i]);
    sort(all(K));
    bool ff = true;
    priority_queue<int,vector<int>, greater<int>> pq;
    for(auto j : K){
        while(ptr + 1 < vr.size() && vr[ptr + 1].fi <= j) pq.push(vr[ptr + 1].se), ptr++;
        int u = j;
        while(u){
            if(pq.empty()) return 0;
            if(pq.top() >= j) u--;
            pq.pop();
        }
    }
    return 1;
}
//#define lpv
#ifdef lpv
int n_, a_[N], b_[N];
int inQ;
int inM, inK[N];
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    #define task "v"
    if(fopen(task ".inp","r")){
        freopen(task ".inp","r",stdin);
        freopen(task ".out","w",stdout);
    }

    cin >> n_ >> inQ;
      for (int i = 0; i < n_; ++i) cin >> a_[i] >> b_[i];
      init(n_, a_, b_);

      while (inQ--) {
        cin >> inM;
        for (int i = 0; i < inM; ++i) cin >> inK[i];
        cout << can(inM, inK) << "\n";
      }
}
#endif // lpv

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:38:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         while(ptr + 1 < vr.size() && vr[ptr + 1].fi <= j) pq.push(vr[ptr + 1].se), ptr++;
      |               ~~~~~~~~^~~~~~~~~~~
teams.cpp:35:10: warning: unused variable 'ff' [-Wunused-variable]
   35 |     bool ff = true;
      |          ^~

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3536 KB Output is correct
2 Correct 15 ms 3640 KB Output is correct
3 Correct 22 ms 4044 KB Output is correct
4 Correct 16 ms 4504 KB Output is correct
5 Correct 10 ms 3028 KB Output is correct
6 Correct 12 ms 2956 KB Output is correct
7 Correct 9 ms 3028 KB Output is correct
8 Correct 9 ms 3100 KB Output is correct
9 Correct 11 ms 3792 KB Output is correct
10 Correct 10 ms 3536 KB Output is correct
11 Correct 8 ms 3276 KB Output is correct
12 Correct 9 ms 3536 KB Output is correct
13 Correct 14 ms 3284 KB Output is correct
14 Correct 15 ms 3788 KB Output is correct
15 Correct 13 ms 3284 KB Output is correct
16 Correct 12 ms 3280 KB Output is correct
17 Correct 13 ms 3284 KB Output is correct
18 Correct 13 ms 3284 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 3792 KB Output is correct
2 Correct 18 ms 3780 KB Output is correct
3 Execution timed out 4029 ms 4648 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 16232 KB Output is correct
2 Correct 78 ms 17152 KB Output is correct
3 Execution timed out 4090 ms 19484 KB Time limit exceeded
4 Halted 0 ms 0 KB -