oj.uz

답안 #963976

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
963976 2024-04-16T06:30:32 Z irmuun 로봇 (IOI13_robots) C++17
76 / 100
 3000 ms 35780 KB 
#include<bits/stdc++.h>
#include "robots.h"

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int putaway(int A,int B,int T,int X[],int Y[],int W[],int S[]){
    pair<int,int>toy[T];
    for(int i=0;i<T;i++){
        toy[i].ff=W[i];
        toy[i].ss=S[i];
    }
    sort(toy,toy+T);
    sort(X,X+A);
    sort(Y,Y+B);
    int l=1,r=T+1;
    vector<bool>used(T);
    while(l<r){
        int mid=(l+r)/2;
        fill(all(used),0);
        set<pair<int,int>,greater<pair<int,int>>>st;
        int le=0;
        for(int i=0;i<A;i++){
            while(le<T&&toy[le].ff<X[i]){
                st.insert({toy[le].ss,le});
                le++;
            }
            int cur=mid;
            while(cur--&&!st.empty()){
                used[st.begin()->ss]=true;
                st.erase(st.begin());
            }
        }
        st.clear();
        for(int i=0;i<T;i++){
            if(!used[i]){
                st.insert({toy[i].ss,i});
            }
        }
        for(int i=B-1;i>=0;i--){
            int cur=mid;
            while(cur--&&!st.empty()){
                if(st.begin()->ff<Y[i]){
                    st.erase(st.begin());
                }
                else break;
            }
        }
        if(!st.empty()) l=mid+1;
        else r=mid;
    }
    if(l==T+1) return -1;
    return l;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2484 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 448 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Execution timed out 3009 ms 35780 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 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 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #4
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 352 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 1 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 18 ms 984 KB Output is correct
17 Correct 20 ms 860 KB Output is correct
18 Correct 28 ms 1084 KB Output is correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 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 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Execution timed out 3093 ms 35668 KB Time limit exceeded
11 Halted 0 ms 0 KB -