oj.uz

답안 #1036294

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1036294 2024-07-27T08:21:43 Z beaconmc 로봇 (IOI13_robots) C++14
100 / 100
 1550 ms 50240 KB 
#include "robots.h"
#include <bits/stdc++.h>

typedef int ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)

using namespace std;


bool lmao(vector<ll>& stuff, vector<ll>& robot, ll k){
    reverse(stuff.begin(), stuff.end());

    ll cur = 0;
    for (auto&i : robot){
        ll cnt = 0;
        while (cur < stuff.size() && cnt < k){
            if (stuff[cur] < i) cur++, cnt++;
            else break;
        }
    }
    if (cur == stuff.size()) return true;
    else return false;
}


int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    vector<ll> x(A),y(B);
    vector<vector<ll>> lol(T);
    FOR(i,0,A) x[i] = (X[i]);
    FOR(i,0,B) y[i] = (Y[i]);
    FOR(i,0,T) lol[i] = {W[i], S[i]};

    sort(x.begin(), x.end());
    sort(y.begin(), y.end());
    sort(lol.begin(), lol.end());


    ll l = 1;
    ll r = T+1;
    priority_queue<ll> sus;
    while (l<r){

        ll mid = (l+r)/2;
        
        ll cur = 0;

        for (auto&i : x){
            while (cur < lol.size()){
                if (lol[cur][0] < i) sus.push(lol[cur][1]), cur++;
                else break;
            }
            FOR(k,0,mid){
                if (sus.size()) sus.pop();
                else break;
            }
        }
        while (cur < lol.size()) sus.push(lol[cur][1]), cur++;
        vector<ll> idk;
        while (sus.size()){
            idk.push_back(sus.top());
            sus.pop();
        }

        if (lmao(idk,y,mid)) r = mid;
        else l = mid+1;
    }
    if (l==T+1) return -1;
    else return l;

}

Compilation message

robots.cpp: In function 'bool lmao(std::vector<int>&, std::vector<int>&, ll)':
robots.cpp:17:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |         while (cur < stuff.size() && cnt < k){
      |                ~~~~^~~~~~~~~~~~~~
robots.cpp:22:13: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     if (cur == stuff.size()) return true;
      |         ~~~~^~~~~~~~~~~~~~~
robots.cpp: In function 'int putaway(int, int, int, int*, int*, int*, int*)':
robots.cpp:49:24: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |             while (cur < lol.size()){
      |                    ~~~~^~~~~~~~~~~~
robots.cpp:58:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         while (cur < lol.size()) sus.push(lol[cur][1]), cur++;
      |                ~~~~^~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 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 0 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 0 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1022 ms 34168 KB Output is correct
5 Correct 1357 ms 44744 KB Output is correct
6 Correct 29 ms 4952 KB Output is correct
7 Correct 397 ms 41604 KB Output is correct
8 Correct 813 ms 46020 KB Output is correct
9 Correct 1363 ms 45268 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 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 0 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #4
37.0 / 37.0

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 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 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 11 ms 1112 KB Output is correct
17 Correct 11 ms 1124 KB Output is correct
18 Correct 13 ms 1216 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 948 ms 34244 KB Output is correct
11 Correct 1242 ms 44664 KB Output is correct
12 Correct 27 ms 4952 KB Output is correct
13 Correct 351 ms 41672 KB Output is correct
14 Correct 707 ms 46012 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 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 9 ms 1372 KB Output is correct
22 Correct 1411 ms 48532 KB Output is correct
23 Correct 1359 ms 45248 KB Output is correct
24 Correct 409 ms 46284 KB Output is correct
25 Correct 424 ms 44940 KB Output is correct
26 Correct 465 ms 50240 KB Output is correct
27 Correct 588 ms 47944 KB Output is correct
28 Correct 807 ms 47880 KB Output is correct
29 Correct 1550 ms 48640 KB Output is correct