Submission #300647

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
300647	2020-09-17T10:56:35 Z	rocks03	Finding Routers (IOI20_routers)	C++14	98.1024 / 100	2 ms	512 KB

routers

#include<bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int) (x).size())
using namespace std;


int use_detector(int x);

vector<int> find_routers(int l, int n, int q){
    vector<int> ans(n);
    vector<int> maxpos(n, l);
    ans[0] = 0;
    int last = 0;
    for(int i = 1; i < n; i++){
        int l = last + 1, r = maxpos[i];
        while(r - l > 1){
            int m = (l + r) / 2;
            int index = use_detector(m);
            maxpos[index] = min(m, maxpos[index]);
            if(index != i-1)
                r = m;
            else
                l = m;
        }
        ans[i] = 2 * ((r - 1) - last) + last;
        last = ans[i];
    }
    return ans;
}

Subtask #1

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	0 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	1 ms	288 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	0 ms	256 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct

Subtask #2

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct

Subtask #3

23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	256 KB	Output is correct
12	Correct	0 ms	256 KB	Output is correct
13	Correct	0 ms	256 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	0 ms	256 KB	Output is correct
19	Correct	0 ms	256 KB	Output is correct
20	Correct	0 ms	256 KB	Output is correct

Subtask #4

38.1024 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	1 ms	384 KB	Partial score
2	Partially correct	1 ms	256 KB	Partial score
3	Partially correct	1 ms	384 KB	Partial score
4	Partially correct	2 ms	384 KB	Partial score
5	Partially correct	1 ms	384 KB	Partial score
6	Partially correct	1 ms	256 KB	Partial score
7	Partially correct	1 ms	512 KB	Partial score
8	Partially correct	1 ms	256 KB	Partial score
9	Partially correct	1 ms	384 KB	Partial score
10	Partially correct	1 ms	384 KB	Partial score
11	Correct	1 ms	384 KB	Output is correct
12	Partially correct	1 ms	384 KB	Partial score
13	Correct	1 ms	256 KB	Output is correct
14	Partially correct	1 ms	512 KB	Partial score
15	Partially correct	1 ms	384 KB	Partial score
16	Partially correct	1 ms	384 KB	Partial score
17	Partially correct	2 ms	384 KB	Partial score
18	Partially correct	1 ms	384 KB	Partial score
19	Partially correct	1 ms	384 KB	Partial score
20	Partially correct	1 ms	384 KB	Partial score
21	Partially correct	1 ms	384 KB	Partial score