oj.uz

Submission #965518

# Submission time Handle Problem Language Result Execution time Memory
965518 2024-04-18T18:50:02 Z ThegeekKnight16 Robots (IOI13_robots) C++17
76 / 100
 3000 ms 34452 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;
            while (remov > 0 && !remain.empty()) 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;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
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 2613 ms 27368 KB Output is correct
5 Correct 83 ms 8552 KB Output is correct
6 Correct 43 ms 5720 KB Output is correct
7 Correct 440 ms 10752 KB Output is correct
8 Correct 1221 ms 23856 KB Output is correct
9 Execution timed out 3044 ms 34228 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 4440 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 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 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 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 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 4440 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 4544 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 4928 KB Output is correct
17 Correct 17 ms 4696 KB Output is correct
18 Correct 19 ms 5168 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 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 2543 ms 27164 KB Output is correct
11 Correct 83 ms 8552 KB Output is correct
12 Correct 45 ms 5720 KB Output is correct
13 Correct 440 ms 10732 KB Output is correct
14 Correct 1262 ms 23640 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 4440 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 11 ms 4700 KB Output is correct
22 Execution timed out 3022 ms 34452 KB Time limit exceeded
23 Halted 0 ms 0 KB -