oj.uz

Submission #968861

# Submission time Handle Problem Language Result Execution time Memory
968861 2024-04-24T07:52:32 Z anango Robots (IOI13_robots) C++17
100 / 100
 1669 ms 30700 KB 
#include "robots.h"
#include <bits/stdc++.h>

using namespace std;
int a,b,t;
vector<pair<int,int>> sortedbyx;
vector<int> xv;
vector<int> yv;
vector<int> wv;
vector<int> sv;

bool BSTA(int time) {
    //cout << "BSTA" << " " << time << endl;
    priority_queue<int> leftvalues;
    int pointer=0;
    //start by placing the vertical dividers
    for (int i=0; i<a; i++) {
        int val=wv[i];
        int ct=0;
        //put into the set as {y,x}
        while (pointer<t && sortedbyx[pointer].first < val) {
            //cout <<pointer <<"  " << "INSERTING " << -sortedbyx[pointer].second << endl;
            leftvalues.push(sortedbyx[pointer].second);
            pointer++;
        }
        while (ct<time && leftvalues.size()) {
            leftvalues.pop();
            ct++;
        }  
        
    }
    while (pointer<t) {
        leftvalues.push(sortedbyx[pointer].second);
        pointer++;

    }
    
    int work=1;
    vector<int> normalvalues; //y values
    while (leftvalues.size()) {
        normalvalues.push_back(leftvalues.top());
        leftvalues.pop();
    }
    sort(normalvalues.begin(), normalvalues.end());

    /*for (auto i:normalvalues) {
        cout << i << " ";
    }
    cout << endl;*/
    int cur=0;
    int lastr=0;
    for (int i=0; i<b; i++) {
        int r=lower_bound(normalvalues.begin(), normalvalues.end(), sv[i])-normalvalues.begin();
        r=normalvalues.size()-r;
        //cout <<"megabloat " <<  i <<" " << sv[i] <<" " << r << endl;
        if (i==b-1 && r>0) {
            return 0;
        }
        else if (i!=b-1 && (r/((b-i-1))>time || (r/((b-i-1))==time && r%(b-i-1)!=0))) {
            //cout <<"BSTA" <<" " << time <<" " << 0 << endl;
            return 0;
        }
    }
    if (normalvalues.size() > b*time) {
        return 0;
    }
    //cout <<"BSTA" <<" " << time <<" " << 1;
    return 1;
    


}

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    
    a=A;
    b=B;
    t=T;
    xv=vector<int>(T,-1);
    yv=vector<int>(T,-1);
    wv=vector<int>(A,-1);
    sv=vector<int>(B,-1);
    for (int i=0; i<T; i++) {
        xv[i] = W[i];
        yv[i] = S[i];
        sortedbyx.push_back({W[i], S[i]});  
    }
    sort(sortedbyx.begin(), sortedbyx.end());
    for (auto i:sortedbyx) {
        //cout << i.first <<" " << i.second << endl;
    }
    int mw=0;
    int ms=0;
    for (int i=0; i<A; i++) {
        wv[i] = X[i];
        mw=max(mw,X[i]);
    }
    for (int i=0; i<B; i++) {
        sv[i] = Y[i];
        ms=max(ms,Y[i]);
    }
    sort(wv.begin(), wv.end());
    sort(sv.begin(), sv.end());
    for (int i=0; i<T; i++) {
        //cout << i <<" " << mw << " " << ms <<" " << W[i] <<" " << S[i] << endl;
        if (W[i] >= mw && S[i] >= ms) {
            return -1;
        }
    }
    int l=1;
    int r=T*2;
    while (l<r) {
        int m=(l+r)/2;
        int bst=BSTA(m);
        //cout << l <<" " << r << " " << m <<" " << bst << endl;
        if (bst) {
            l=l;
            r=m;
        }
        else {
            l=m+1;
            r=r;
        }
    }
    if (l>0 && BSTA(l-1)) {
        l--;
    }
    if (!BSTA(l)) {
        l++;
    }
    if (l>T) {
        return -1;
    }
    return l;
}

Compilation message

robots.cpp: In function 'bool BSTA(int)':
robots.cpp:64:29: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   64 |     if (normalvalues.size() > b*time) {
      |         ~~~~~~~~~~~~~~~~~~~~^~~~~~~~
robots.cpp:38:9: warning: unused variable 'work' [-Wunused-variable]
   38 |     int work=1;
      |         ^~~~
robots.cpp:50:9: warning: unused variable 'cur' [-Wunused-variable]
   50 |     int cur=0;
      |         ^~~
robots.cpp:51:9: warning: unused variable 'lastr' [-Wunused-variable]
   51 |     int lastr=0;
      |         ^~~~~
robots.cpp: In function 'int putaway(int, int, int, int*, int*, int*, int*)':
robots.cpp:89:15: warning: variable 'i' set but not used [-Wunused-but-set-variable]
   89 |     for (auto i:sortedbyx) {
      |               ^

Subtask #1
14.0 / 14.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 4440 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

# 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 1136 ms 16428 KB Output is correct
5 Correct 126 ms 13332 KB Output is correct
6 Correct 23 ms 5844 KB Output is correct
7 Correct 265 ms 14012 KB Output is correct
8 Correct 818 ms 16132 KB Output is correct
9 Correct 1519 ms 16880 KB Output is correct

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 4692 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 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 4440 KB Output is correct
11 Correct 1 ms 4440 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 12 ms 4700 KB Output is correct
17 Correct 14 ms 4700 KB Output is correct
18 Correct 18 ms 4956 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 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 4440 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 1121 ms 16248 KB Output is correct
11 Correct 145 ms 13784 KB Output is correct
12 Correct 23 ms 5848 KB Output is correct
13 Correct 269 ms 14036 KB Output is correct
14 Correct 794 ms 15964 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4440 KB Output is correct
17 Correct 1 ms 4440 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 11 ms 4700 KB Output is correct
22 Correct 1669 ms 18884 KB Output is correct
23 Correct 1506 ms 27424 KB Output is correct
24 Correct 406 ms 28120 KB Output is correct
25 Correct 444 ms 26308 KB Output is correct
26 Correct 622 ms 30700 KB Output is correct
27 Correct 663 ms 28608 KB Output is correct
28 Correct 775 ms 28400 KB Output is correct
29 Correct 1546 ms 29276 KB Output is correct