Submission #883555

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
883555	2023-12-05T12:06:29 Z	ibm2006	Finding Routers (IOI20_routers)	C++17	100 / 100	8 ms	740 KB

routers

#include<bits/stdc++.h>
#include "routers.h"
using namespace std;
typedef int ll;
ll n,i,j,k,L,l,r,x,y,z,w,le[110000],ri[110000],b[110000],p[110000];
vector<ll> a;
ll f(ll y)
{
    ll l=0,r=L,z,i;
    l=max(l,le[y]);
    r=min(r,ri[y]);
    ll mid=(l+r+1)/2;
    while(l<r)
    {
       mid=(l+r+1)/2;
       z=use_detector(mid);
       for(i=0;i<=z;i++)
       {
           ri[i]=min(ri[i],mid-1);
       }
       for(i=z+1;i<n;i++)
       {
           le[i]=max(le[i],mid);
       }
       if(z<=y-1)
       {
           l=mid;
       }
       else
        r=mid-1;
    }
    mid=(l+r+1)/2;
    b[y]=mid;
    return mid;
}
vector<int> find_routers(int l, int N, int q) {
    L=l;
    n=N;
    a.resize(n);
	for(i=0;i<n;i++)
        ri[i]=l;
        srand(time(NULL));
        for(i=1;i<n;i++)
        {
            p[i]=i;
        }
        random_shuffle(p+1,p+n);
	for(i=1;i<n;i++)
    {
        b[p[i]]=f(p[i]);
        
        for(j=0;j<p[i];j++)
        {
            ri[j]=min(ri[j],b[p[i]]);
        }
        for(j=p[i]+1;j<n;j++)
        {
            le[j]=max(le[j],b[p[i]]+1);
        }
    }
    for(i=1;i<n;i++)
    {
        
        a[i]=a[i-1]+2*(b[i]-a[i-1]);
    }
    return a;
}

Subtask #1

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 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	1 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	1 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	1 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	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct

Subtask #2

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	444 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	500 KB	Output is correct
5	Correct	0 ms	360 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	600 KB	Output is correct
8	Correct	0 ms	440 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	448 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct

Subtask #3

23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	448 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	448 KB	Output is correct
9	Correct	0 ms	344 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	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	604 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	444 KB	Output is correct

Subtask #4

40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	348 KB	Output is correct
2	Correct	7 ms	348 KB	Output is correct
3	Correct	7 ms	348 KB	Output is correct
4	Correct	7 ms	344 KB	Output is correct
5	Correct	7 ms	348 KB	Output is correct
6	Correct	7 ms	740 KB	Output is correct
7	Correct	7 ms	348 KB	Output is correct
8	Correct	7 ms	348 KB	Output is correct
9	Correct	7 ms	344 KB	Output is correct
10	Correct	7 ms	348 KB	Output is correct
11	Correct	3 ms	348 KB	Output is correct
12	Correct	7 ms	348 KB	Output is correct
13	Correct	3 ms	348 KB	Output is correct
14	Correct	8 ms	488 KB	Output is correct
15	Correct	7 ms	352 KB	Output is correct
16	Correct	7 ms	352 KB	Output is correct
17	Correct	7 ms	356 KB	Output is correct
18	Correct	7 ms	480 KB	Output is correct
19	Correct	7 ms	360 KB	Output is correct
20	Correct	7 ms	360 KB	Output is correct
21	Correct	7 ms	356 KB	Output is correct