oj.uz

Submission #954322

# Submission time Handle Problem Language Result Execution time Memory
954322 2024-03-27T15:44:59 Z kunzaZa183 Teams (IOI15_teams) C++17
21 / 100
 28 ms 8336 KB 
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
 
const int maxn = 100;
 
pair<int, int> arrpii[maxn];
 
int n;
 
void init(int N, int A[], int B[])
{
  n = N;
  for (int i = 0; i < N; i++)
    arrpii[i] = {A[i], B[i]};
  sort(arrpii, arrpii + N, [](pair<int, int> a, pair<int, int> b)
       { return a.second < b.second; });
}
 
int can(int M, int K[])
{
  sort(K, K + M, greater<int>());
  pair<int, int> copy[maxn];
  for (int i = 0; i < n; i++)
    copy[i] = arrpii[i];
  for (int i = 0; i < M; i++)
  {
    vector<pair<int, int>> spii;
    for (int j = 0; j < n; j++)
      if (copy[j].first <= K[i] && K[i] <= copy[j].second)
      {
        spii.emplace_back(arrpii[j].first, j);
        // cerr << arrpii[j].first << ' ' << arrpii[j].second << "\n";
      }
    if (spii.size() < K[i])
      return 0;
    sort(spii.begin(), spii.end(), greater<pair<int,int>>());
    for (int j = 0; j < K[i]; j++)
      copy[spii[j].second] = {0, -1};
  }
  return 1;
}
 
// static char _buffer[1024];
// static int _currentChar = 0;
// static int _charsNumber = 0;
// static FILE *_inputFile, *_outputFile;
 
// static inline int _read()
// {
//   if (_charsNumber < 0)
//   {
//     exit(1);
//   }
//   if (!_charsNumber || _currentChar == _charsNumber)
//   {
//     _charsNumber = (int)fread(_buffer, sizeof(_buffer[0]), sizeof(_buffer), _inputFile);
//     _currentChar = 0;
//   }
//   if (_charsNumber <= 0)
//   {
//     return -1;
//   }
//   return _buffer[_currentChar++];
// }
 
// static inline int _readInt()
// {
//   int c, x, s;
//   c = _read();
//   while (c <= 32)
//     c = _read();
//   x = 0;
//   s = 1;
//   if (c == '-')
//   {
//     s = -1;
//     c = _read();
//   }
//   while (c > 32)
//   {
//     x *= 10;
//     x += c - '0';
//     c = _read();
//   }
//   if (s < 0)
//     x = -x;
//   return x;
// }
 
// int main()
// {
//   _inputFile = fopen("teams.in", "rb");
//   _outputFile = fopen("teams.out", "w");
//   int N;
//   N = _readInt();
//   int *A = (int *)malloc(sizeof(int) * (unsigned int)N);
//   int *B = (int *)malloc(sizeof(int) * (unsigned int)N);
//   for (int i = 0; i < N; ++i)
//   {
//     A[i] = _readInt();
//     B[i] = _readInt();
//   }
//   init(N, A, B);
//   int Q;
//   Q = _readInt();
//   for (int i = 0; i < Q; ++i)
//   {
//     int M;
//     M = _readInt();
//     int *K = (int *)malloc(sizeof(int) * (unsigned int)M);
//     for (int j = 0; j < M; ++j)
//     {
//       K[j] = _readInt();
//     }
//     fprintf(_outputFile, "%d\n", can(M, K));
//   }
//   return 0;
// }

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:35:21: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   35 |     if (spii.size() < K[i])
      |         ~~~~~~~~~~~~^~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 440 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 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 0 ms 440 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 13.0

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

Subtask #3
0 / 43.0

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

Subtask #4
0 / 23.0

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