oj.uz

Submission #433378

# Submission time Handle Problem Language Result Execution time Memory
433378 2021-06-19T16:33:55 Z Enkognit Stations (IOI20_stations) C++14
0 / 100
 1 ms 320 KB 
#include <bits/stdc++.h>
#include "stations.h"
#include <vector>
#define ll long long
#define mp make_pair
#define pb push_back
#define fi first
#define se second

using namespace std;

vector<ll> c[1005];
vector<int> vv;
ll T;

void dfs(int h,int k=0, int p=-1)
{
    if (k%2==0) vv.pb(h);
    for (int i = 0; i < c[h].size(); i++)
        if (c[h][i]!=p)
        {
            dfs(c[h][i], k+1, h);
        }
    if (k%2) vv.pb(h);
}

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {

	vector<int> f;

	T=0;


	//vector<pair<ll, ll> > ed;

	for (int i = 0; i < u.size(); i++)
    {
        //ed.pb(mp(u[i], v[i]));
        c[u[i]].pb(v[i]);
        c[v[i]].pb(u[i]);
    }


    dfs(0);

    f.resize(n, 0);

    for (int i = 0; i < n; i++)
        f[vv[i]]=i;

    //for (int i = 0; i < n; i++) cout << vv[i] << "\n";

    //for (int i = 0; i < ed.size(); i++)
    //    cout << vv[ed[i].fi] << " " << vv[ed[i].se] << "\n";

    //cout << "---\n";

	for (int i = 0; i < n; i++) c[i].clear();

    //assert(f.size()==n);
    //assert(T==n);

    T=0;
    vv.clear();

	return vv;
}

int find_next_station(int s, int t, std::vector<int> c)
{
    //for (int i = 0; i < c.size(); i++)
    //    cout << c[i] << " ";
    //cout << "\n";
    assert(c.size()==0);

    if (s<c[0])
    {
        if (!(t>s && t<c[0])) return c[0];
        ll lst=s;
        for (int i = 1; i < c.size(); i++)
            if (t>lst && c[i]>=t) return c[i]; else lst=c[i];
        return c[0];
    }else
    {
        if (!(t<s && t>c[0])) return c[0];
        ll lst=s;
        for (int i = c.size()-1; i > -1; i--)
            if (t<lst && t>=c[i]) return c[i]; else lst=c[i];
    }
    //assert(0);
    return 1;
}
/*
1
5 10
0 1
1 2
1 3
2 4
2
2 0 2
1 3 3
*/

Compilation message

stations.cpp: In function 'void dfs(int, int, int)':
stations.cpp:19:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for (int i = 0; i < c[h].size(); i++)
      |                     ~~^~~~~~~~~~~~~
stations.cpp: In function 'std::vector<int> label(int, int, std::vector<int>, std::vector<int>)':
stations.cpp:36:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |  for (int i = 0; i < u.size(); i++)
      |                  ~~^~~~~~~~~~
stations.cpp: In function 'int find_next_station(int, int, std::vector<int>)':
stations.cpp:80:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |         for (int i = 1; i < c.size(); i++)
      |                         ~~^~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 312 KB Invalid length of array as the response of 'label'. scenario=0, n=10, len=0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 320 KB Invalid length of array as the response of 'label'. scenario=0, n=996, len=0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Invalid length of array as the response of 'label'. scenario=0, n=2, len=0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Invalid length of array as the response of 'label'. scenario=0, n=2, len=0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 61.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 312 KB Invalid length of array as the response of 'label'. scenario=0, n=3, len=0
2 Halted 0 ms 0 KB -