oj.uz

Submission #330352

# Submission time Handle Problem Language Result Execution time Memory
330352 2020-11-24T21:09:58 Z marvenlee Stations (IOI20_stations) C++14
0 / 100
 997 ms 868 KB 
#include "stations.h"
#include <vector>
#include <iostream>
#include <math.h>

using namespace std;

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
    std::vector<int> labels(n);
    for(int i=0;i<n;i++){
        labels[i]=i+1;
    }
	return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {

    if(t<s){
            int minv=c[0];
        for(auto it=c.begin();it!=c.end();it++){
            minv=min(minv,*it);
        }
        return minv;
    }
    else{
        while(floor(log2(t))!=floor(log2(s))){
            t/=2;
        }
        if(t/2!=s)
            {
            int minv=c[0];
        for(auto it=c.begin();it!=c.end();it++){
            minv=min(minv,*it);
        }
        return minv;
        }
        else{
            return t;
        }
    }

}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 997 ms 868 KB Output is correct
2 Incorrect 662 ms 756 KB Wrong query response.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

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