oj.uz

Submission #965519

# Submission time Handle Problem Language Result Execution time Memory
965519 2024-04-18T18:52:54 Z ThegeekKnight16 Robots (IOI13_robots) C++17
76 / 100
 3000 ms 34276 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;
    vector<int> sweep; //id
    sweep.reserve(max(A, B)+T);
    int idT = 0, idA = 0;
    while (idT < T && idA < A)
    {
        if (X[idA] <= Toy[idT].first) sweep.push_back(-1), idA++;
        else sweep.push_back(idT++);
    }
    while (idT < T) sweep.push_back(idT++);
    while (idA < A) sweep.push_back(-1), idA++;

    multiset<int> remain;
    for (auto id : sweep)
    {
        if (id == -1)
        {
            int remov = x;
            if (remov >= remain.size()) remain.clear(), remov = 0;
            while (remov > 0) remain.erase(prev(remain.end())), --remov;
        }
        else remain.insert(Toy[id].second);
    }

    sweep.clear(); //now type
    auto it = remain.begin(); int idB = 0;
    while (it != remain.end() && idB < B)
    {
        if (Y[idB] <= *it) sweep.push_back(-1), idB++;
        else sweep.push_back(1), it++;
    }
    if (it != remain.end()) return 0;
    while (idB < B) sweep.push_back(-1), idB++;

    int cnt = 0;
    for (auto type : sweep)
    {
        if (type == -1) cnt = max(0, cnt-x);
        else cnt++;
    }
    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:27:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::multiset<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |             if (remov >= remain.size()) remain.clear(), remov = 0;
      |                 ~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4544 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
0 / 14.0

# Verdict Execution time Memory 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 2553 ms 27220 KB Output is correct
5 Correct 81 ms 8528 KB Output is correct
6 Correct 36 ms 5468 KB Output is correct
7 Correct 357 ms 10760 KB Output is correct
8 Correct 1097 ms 23856 KB Output is correct
9 Execution timed out 3023 ms 34276 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory 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 4444 KB Output is correct
9 Correct 1 ms 4440 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 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory 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 4440 KB Output is correct
5 Correct 1 ms 4440 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 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 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 10 ms 4712 KB Output is correct
17 Correct 16 ms 4700 KB Output is correct
18 Correct 18 ms 4956 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 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 2513 ms 27136 KB Output is correct
11 Correct 81 ms 8532 KB Output is correct
12 Correct 36 ms 5456 KB Output is correct
13 Correct 361 ms 10732 KB Output is correct
14 Correct 1089 ms 23552 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 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 10 ms 4856 KB Output is correct
22 Execution timed out 3044 ms 34256 KB Time limit exceeded
23 Halted 0 ms 0 KB -