oj.uz

Submission #965527

# Submission time Handle Problem Language Result Execution time Memory
965527 2024-04-18T19:16:49 Z ThegeekKnight16 Robots (IOI13_robots) C++17
76 / 100
 3000 ms 25172 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;
    multiset<int> remain;
    while (idT < T && idA < A)
    {
        if (X[idA] <= Toy[idT].first)
        {
            int remov = x;
            if (remov >= remain.size()) remain.clear(), remov = 0;
            while (remov > 0) remain.erase(prev(remain.end())), remov--;
            idA++;
        }
        else remain.insert(Toy[idT++].second);
    }
    while (idT < T) remain.insert(Toy[idT++].second);
    while (idA < A)
    {
        int remov = x;
        if (remov >= remain.size()) remain.clear(), remov = 0;
        while (remov > 0) remain.erase(prev(remain.end())), remov--;
        idA++;
    }

    auto idR = remain.begin(); int idB = 0;
    int cnt = 0;
    while (idR != remain.end() && idB < B)
    {
        if (Y[idB] <= *idR) cnt = max(0, cnt-x), idB++;
        else cnt++, idR++;
    }
    if (idR != remain.end()) 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:17:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::multiset<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |             if (remov >= remain.size()) remain.clear(), remov = 0;
      |                 ~~~~~~^~~~~~~~~~~~~~~~
robots.cpp:27:19: 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 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

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4456 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Execution timed out 3089 ms 25032 KB Time limit exceeded
5 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 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 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 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 4700 KB Output is correct
17 Correct 15 ms 4700 KB Output is correct
18 Correct 21 ms 5100 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 4696 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Execution timed out 3036 ms 25172 KB Time limit exceeded
11 Halted 0 ms 0 KB -