oj.uz

Submission #132320

# Submission time Handle Problem Language Result Execution time Memory
132320 2019-07-18T17:10:50 Z reda Teams (IOI15_teams) C++14
13 / 100
 4000 ms 31852 KB 
#include<bits/stdc++.h>
using namespace std ;
# include "teams.h"
vector<pair<int,int>>  v; 
void init( int  n , int a[] , int  b[])
{
    for(int i= 0; i < n ; i ++)
    {
        v.push_back(make_pair(b[i],a[i]));
    }
    sort(v.begin(),v.end());
}
int  can(int M, int  K[])
{
      set < pair <int, int> > s;
      int p = 0;
      sort(K, K + M);
      for(int i = 0; i < M; i ++)
      {
            int flag = K[i];
            while(p < v.size() && flag > 0)
                {
                  s.insert({v[p].second, p});
                  p++;
                  while( flag> 0 && !s.empty())
                  {
                        pair <int, int> it = *s.begin();
                        if(it.first <= K[i] && K[i] <= v[it.second].first)
                        {
                              s.erase(s.begin());
                              flag--;
                        } 
                        else if(v[it.second].first < K[i])s.erase(s.begin());
                        else break;
                  }
                }
            if(flag > 0) return 0;
      }
      return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:21:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(p < v.size() && flag > 0)
                   ~~^~~~~~~~~~

Subtask #1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 380 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 256 KB Output is correct
18 Incorrect 2 ms 376 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 6640 KB Output is correct
2 Correct 67 ms 6508 KB Output is correct
3 Correct 27 ms 2288 KB Output is correct
4 Correct 69 ms 7020 KB Output is correct
5 Correct 20 ms 2288 KB Output is correct
6 Correct 20 ms 2288 KB Output is correct
7 Correct 46 ms 6636 KB Output is correct
8 Correct 45 ms 6636 KB Output is correct
9 Correct 16 ms 2288 KB Output is correct
10 Correct 15 ms 2800 KB Output is correct
11 Correct 15 ms 2800 KB Output is correct
12 Correct 16 ms 2928 KB Output is correct
13 Correct 24 ms 3184 KB Output is correct
14 Correct 22 ms 3312 KB Output is correct
15 Correct 21 ms 3564 KB Output is correct
16 Correct 63 ms 7660 KB Output is correct
17 Correct 26 ms 3820 KB Output is correct
18 Correct 28 ms 4588 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4091 ms 7096 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 4057 ms 31852 KB Time limit exceeded
2 Halted 0 ms 0 KB -