oj.uz

Submission #802309

# Submission time Handle Problem Language Result Execution time Memory
802309 2023-08-02T11:32:43 Z Khizri Teams (IOI15_teams) C++17
34 / 100
 4000 ms 11468 KB 
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
const int mxn=2e5+5;
int n,x[mxn],y[mxn];
void init(int N, int A[], int B[]) {
    n=N;
    for(int i=0;i<n;i++){
        x[i+1]=A[i];
        y[i+1]=B[i];
    }
}
bool cmp(pii a,pii b){
    if(a.S==b.S){
        return a.F>b.F;
    }
    return a.S<b.S;
}
int can(int m, int arr[]) {
	sort(arr,arr+m);
    vector<pii>vt;
    for(int i=1;i<=n;i++){
        vt.pb({x[i],y[i]});
    }
    ll sum=0;
    for(int i=0;i<m;i++){
        sum+=arr[i];
    }
    if(sum>n) return 0;
    sort(all(vt),cmp);
    for(int i=0;i<m;i++){
        int cnt=arr[i];
        for(int j=0;j<vt.size();j++){
            if(!cnt) break;
            if(vt[j].F<=arr[i]&&vt[j].S>=arr[i]){
                vt.erase(vt.begin()+j);
                j--;
                cnt--;
            }
        }
        if(cnt) return 0;
    }
    return 1;
}
/*
g++ teams.cpp grader.cpp ; .\a.exe

*/

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:44:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |         for(int j=0;j<vt.size();j++){
      |                     ~^~~~~~~~~~

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 1 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 340 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 0 ms 212 KB Output is correct
12 Correct 1 ms 340 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 304 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 304 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 212 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 2984 KB Output is correct
2 Correct 16 ms 3020 KB Output is correct
3 Correct 673 ms 3020 KB Output is correct
4 Correct 17 ms 3332 KB Output is correct
5 Correct 3147 ms 3020 KB Output is correct
6 Correct 1619 ms 3020 KB Output is correct
7 Correct 12 ms 3020 KB Output is correct
8 Correct 12 ms 3020 KB Output is correct
9 Correct 3118 ms 3148 KB Output is correct
10 Correct 3115 ms 3020 KB Output is correct
11 Correct 3132 ms 3020 KB Output is correct
12 Correct 2992 ms 3020 KB Output is correct
13 Correct 2422 ms 3020 KB Output is correct
14 Correct 1361 ms 4020 KB Output is correct
15 Correct 702 ms 4104 KB Output is correct
16 Correct 140 ms 4056 KB Output is correct
17 Correct 2280 ms 4024 KB Output is correct
18 Correct 2505 ms 4044 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2366 ms 4084 KB Output is correct
2 Correct 2877 ms 5632 KB Output is correct
3 Execution timed out 4078 ms 5084 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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