oj.uz

Submission #430873

# Submission time Handle Problem Language Result Execution time Memory
430873 2021-06-17T07:21:48 Z p_square Teams (IOI15_teams) C++14
34 / 100
 4000 ms 8480 KB 
#include "teams.h"
#include <bits/stdc++.h>

using namespace std;

#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second
#define pb push_back

vector<pii> stud;
int n;

struct cmp
{
    bool operator()(pii a, pii b)
    {
        if(a.fi != b.fi)
            return a.fi > b.fi;

        return a.fi > b.fi;
    }
};

void init(int N, int A[], int B[])
{
    n = N;
    for(int i = 0; i<n; i++)
    {
        stud.pb(mp(A[i], B[i]));
    }
    sort(stud.begin(), stud.end(), cmp());
}

int can(int M, int K[])
{
    sort(K, K+M);
    vector<pii> need;
    int dsleft[M];
    need.pb(mp(K[M-1], K[M-1]));
    int ct = 0;
    for(int i = 1; i<M; i++)
    {
        if(K[M-i-1] != need[ct].fi)
        {
            ct++;
            need.pb(mp(K[M-1-i], K[M-1-i]));
        }
        else
        {
            need[ct].se += K[M-i-1];
        }
        dsleft[i] = i;
    }
    M = ct+1;
    int sum;

    for(int i = 0; i<n; i++)
    {
        //cout<<stud[i].fi<<" "<<stud[i].se<<endl;
        for(int j = 0; j<M; j++)
        {
            if(need[j].se == 0)
                continue;
            if(stud[i].fi <= need[j].fi && need[j].fi <= stud[i].se)
            {
                need[j].se--;
                break;
            }
        }
    }

    int ans = 1;
    for(int i = 0; i<M; i++)
    {
        if(need[i].se != 0)
            ans = 0;
    }

    return ans;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:40:9: warning: variable 'dsleft' set but not used [-Wunused-but-set-variable]
   40 |     int dsleft[M];
      |         ^~~~~~
teams.cpp:57:9: warning: unused variable 'sum' [-Wunused-variable]
   57 |     int sum;
      |         ^~~

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 2236 KB Output is correct
2 Correct 60 ms 2184 KB Output is correct
3 Correct 17 ms 2244 KB Output is correct
4 Correct 19 ms 2624 KB Output is correct
5 Correct 27 ms 2980 KB Output is correct
6 Correct 41 ms 2940 KB Output is correct
7 Correct 27 ms 2924 KB Output is correct
8 Correct 27 ms 3012 KB Output is correct
9 Correct 9 ms 3012 KB Output is correct
10 Correct 10 ms 2728 KB Output is correct
11 Correct 11 ms 2756 KB Output is correct
12 Correct 15 ms 2880 KB Output is correct
13 Correct 18 ms 3140 KB Output is correct
14 Correct 16 ms 3140 KB Output is correct
15 Correct 18 ms 3268 KB Output is correct
16 Correct 17 ms 3268 KB Output is correct
17 Correct 13 ms 3236 KB Output is correct
18 Correct 13 ms 3244 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4027 ms 2116 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4066 ms 8480 KB Time limit exceeded
2 Halted 0 ms 0 KB -