oj.uz

Submission #306844

# Submission time Handle Problem Language Result Execution time Memory
306844 2020-09-26T10:48:17 Z baluteshih Stations (IOI20_stations) C++14
0 / 100
 978 ms 880 KB 
#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(),v.end()
#define pb push_back
#define SZ(a) ((int)a.size())

vector<int> idx;

vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
    idx.resize(n);
    for(int i=0;i<n;++i)
        idx[i]=i;
    return idx;
}

int find_next_station(int s, int t, vector<int> c)
{
    int x=t;
    while(x>s)
        x>>=1;
    if(x==s)
    {
        for(x=t;x/2!=s;x>>=1);
        return x;
    }
    return s>>1;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 560 ms 880 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 482 ms 768 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 534 ms 768 KB Wrong query response.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 978 ms 640 KB Output is correct
2 Incorrect 773 ms 640 KB Wrong query response.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Incorrect 627 ms 768 KB Wrong query response.
2 Halted 0 ms 0 KB -