oj.uz

Submission #883535

# Submission time Handle Problem Language Result Execution time Memory
883535 2023-12-05T11:47:18 Z ibm2006 Finding Routers (IOI20_routers) C++17
39 / 100
 1 ms 604 KB 
#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 x,ll y)
{
    ll l=x,r=L,z;
    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);
       ri[z]=min(ri[z],mid-1);
       le[z-1]=min(le[z-1],mid);
       if(z==y-1)
       {
           l=mid;
       }
       else
        r=mid-1;
    }
    mid=(l+r+1)/2;
    b[y]=mid;
    return (mid-x)*2+x;
}
vector<int> find_routers(int l, int n, int q) {
    L=l;
    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++)
    {
        a[p[i]]=f(a[p[i]-1],p[i]);
    }
    return a;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 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 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

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

Subtask #4
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -