oj.uz

답안 #93083

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
93083 2019-01-06T11:50:04 Z Bodo171 로봇 (IOI13_robots) C++14
100 / 100
 1791 ms 19264 KB 
#include "robots.h"
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
using namespace std;
const int nmax=1000*1000+5;
pair<int,int> v[nmax];
int a[nmax],b[nmax];
priority_queue<int> pq;
int A,B,i,n,j;
bool check(int val)
{
    while(!pq.empty()) pq.pop();
    int p=1;
    for(i=1;i<=A;i++)
    {
        while(p<=n&&v[p].first<a[i])
        {
            pq.push(v[p].second);
            p++;
        }
        for(j=1;j<=val&&(!pq.empty());j++)
            pq.pop();
    }
    while(p<=n)
        {
            pq.push(v[p].second);
            p++;
        }
    for(i=B;i>=1;i--)
    {
        for(j=1;j<=val&&(!pq.empty())&&pq.top()<b[i];j++)
            pq.pop();
    }
    return (pq.empty());
}
int putaway(int Aa, int Bb, int T, int X[], int Y[], int W[], int S[]) {
    n=T;
    for(i=1;i<=T;i++)
    {
        v[i].first=W[i-1];
        v[i].second=S[i-1];
    }
    sort(v+1,v+n+1);
    A=Aa;B=Bb;
    for(i=1;i<=A;i++)
        a[i]=X[i-1];
    sort(a+1,a+A+1);
    for(i=1;i<=B;i++)
        b[i]=Y[i-1];
    sort(b+1,b+B+1);
    int timp=(1<<20)-1;
    if(!check(timp)) return -1;
    for(int p=19;p>=0;p--)
        if(check(timp-(1<<p)))
          timp-=(1<<p);
    return timp;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 1300 ms 10820 KB Output is correct
5 Correct 278 ms 10860 KB Output is correct
6 Correct 34 ms 1528 KB Output is correct
7 Correct 396 ms 9792 KB Output is correct
8 Correct 880 ms 10740 KB Output is correct
9 Correct 1748 ms 10728 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct

Subtask #4
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 16 ms 760 KB Output is correct
17 Correct 19 ms 760 KB Output is correct
18 Correct 26 ms 760 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 296 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 1292 ms 10792 KB Output is correct
11 Correct 282 ms 10704 KB Output is correct
12 Correct 36 ms 1528 KB Output is correct
13 Correct 397 ms 9728 KB Output is correct
14 Correct 917 ms 10856 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 16 ms 760 KB Output is correct
22 Correct 1791 ms 18668 KB Output is correct
23 Correct 1777 ms 18764 KB Output is correct
24 Correct 549 ms 19076 KB Output is correct
25 Correct 501 ms 17496 KB Output is correct
26 Correct 635 ms 18920 KB Output is correct
27 Correct 696 ms 19264 KB Output is correct
28 Correct 834 ms 19200 KB Output is correct
29 Correct 1771 ms 19000 KB Output is correct