oj.uz

답안 #978133

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978133 2024-05-08T22:15:03 Z ThegeekKnight16 로봇 (IOI13_robots) C++17
100 / 100
 1330 ms 26652 KB 
#include <bits/stdc++.h>
#include "robots.h"
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("avx2")

bool Test(int x, int A, int B, int T, int *X, int *Y, const vector<pair<int, int>> &Toy)
{
  if ((long long)x*(A+B) < T) return 0;
  int idT = 0, idA = 0;
  priority_queue<int> remain;
  while (idT < T && idA < A)
  {
    if (X[idA] <= Toy[idT].first)
    {
      int remov = x;
      while (remov > 0 && !remain.empty()) remain.pop(), remov--;
      idA++;
    }
    else remain.push(Toy[idT++].second);
  }
  while (idT < T) remain.push(Toy[idT++].second);
  while (idA < A)
  {
    int remov = x;
    while (remov > 0 && !remain.empty()) remain.pop(), remov--;
    idA++;
  }

  vector<int> bonga;
  while (!remain.empty()) bonga.push_back(remain.top()), remain.pop();
  reverse(bonga.begin(), bonga.end());
  auto idR = 0; int idB = 0;
  int cnt = 0;
  while (idR < bonga.size() && idB < B)
  {
    if (Y[idB] <= bonga[idR]) cnt = max(0, cnt-x), idB++;
    else cnt++, idR++;
  }
  if (idR < bonga.size()) return 0;
  while (idB < B) cnt = max(0, cnt-x), idB++;

  return (cnt == 0);
}

int putaway(int A, int B, int T, int X[], int Y[], int _W[], int _S[])
{
  vector<pair<int, int>> Toy(T);
  for (int i = 0; i < T; i++) Toy[i] = make_pair(_W[i], _S[i]);
  sort(X, X+A); sort(Y, Y+B);
  for (int i = 0; i < T; i++) if (Toy[i].first >= X[A-1] && Toy[i].second >= Y[B-1]) return -1;
  sort(Toy.begin(), Toy.end());

  int ini = 1, fim = T;
  while (ini < fim)
  {
    int m = (ini + fim) >> 1;
    if (Test(m, A, B, T, X, Y, Toy)) fim = m;
    else ini = m+1;
  }
  return fim;
}

Compilation message

robots.cpp: In function 'bool Test(int, int, int, int, int*, int*, const std::vector<std::pair<int, int> >&)':
robots.cpp:35:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |   while (idR < bonga.size() && idB < B)
      |          ~~~~^~~~~~~~~~~~~~
robots.cpp:40:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |   if (idR < bonga.size()) return 0;
      |       ~~~~^~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4536 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1014 ms 23284 KB Output is correct
5 Correct 95 ms 18932 KB Output is correct
6 Correct 23 ms 6488 KB Output is correct
7 Correct 221 ms 17004 KB Output is correct
8 Correct 625 ms 22236 KB Output is correct
9 Correct 1227 ms 23284 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4492 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4448 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct

Subtask #4
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4696 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4544 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 7 ms 4956 KB Output is correct
17 Correct 12 ms 4956 KB Output is correct
18 Correct 12 ms 4956 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 994 ms 23000 KB Output is correct
11 Correct 94 ms 19048 KB Output is correct
12 Correct 22 ms 6236 KB Output is correct
13 Correct 229 ms 17004 KB Output is correct
14 Correct 621 ms 22244 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4536 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 7 ms 4700 KB Output is correct
22 Correct 1270 ms 25228 KB Output is correct
23 Correct 1249 ms 23452 KB Output is correct
24 Correct 370 ms 23708 KB Output is correct
25 Correct 374 ms 21104 KB Output is correct
26 Correct 440 ms 26652 KB Output is correct
27 Correct 469 ms 22656 KB Output is correct
28 Correct 591 ms 23180 KB Output is correct
29 Correct 1330 ms 23916 KB Output is correct