oj.uz

Submission #350863

# Submission time Handle Problem Language Result Execution time Memory
350863 2021-01-19T09:23:14 Z beksultan04 Stations (IOI20_stations) C++14
0 / 100
 876 ms 15352 KB 
#include "stations.h"
#ifndef EVAL
#include "stub.cpp"
#endif // EVAL
#include <bits/stdc++.h>
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
const int N = 3e5+12,INF=1e9+7;
vector <int> g[N],asd;
int cnt;
void dfs(int x,int p,int s){
    if (s %2 == 0){
        asd[x] = cnt++;
    }
    for (int to : g[x]){
        if (to == p)continue;
        dfs(to,x,s+1);
    }
    if (s&1)asd[x] = cnt++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
    cnt=0;
	for (int i = 0; i < n-1; i++) {
        g[u[i]].pb(v[i]);
        g[v[i]].pb(u[i]);
	}
	asd.resize(n);
	cnt=0;
	dfs(0,-1,0);
	for (int i=0;i<n;++i){
        g[i].clear();
	}
	return asd;
}


int find_next_station(int s, int t, vector<int> c) {
    int mx = c[c.size()-1],i;

    if (mx > s){
        for (i=c.size()-1;i>=0;--i){
            if (min(s,c[i]) <= t && t <= max(s,c[i]))ret c[i];
        }
    }
    else {
        for (i=0;i<c.size();++i){
            if (min(s,c[i]) <= t && t <= max(s,c[i]))ret c[i];
        }
    }ret c[0];
}

Compilation message

stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:65:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |         for (i=0;i<c.size();++i){
      |                  ~^~~~~~~~~

Subtask #1
0 / 5.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 876 ms 14920 KB Output is correct
2 Incorrect 621 ms 14816 KB Wrong query response.
3 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

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