oj.uz

답안 #385949

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
385949 2021-04-05T09:31:34 Z PedroBigMan 기지국 (IOI20_stations) C++14
52.3205 / 100
 1200 ms 1280 KB 
#include "stations.h"
/*
Author of all code: Pedro BIGMAN Dias
Last edit: 15/02/2021
*/
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <list>
#include <iomanip>
#include <stdlib.h>
#include <time.h>
#include <cstring>
using namespace std;
typedef int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=(ll) a; i<(ll) b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define whole(x) x.begin(),x.end()
#define DEBUG(i) cout<<"Pedro Is The Master "<<i<<endl
#define INF 500000000LL
#define EPS 0.00000001
#define pi 3.14159
ll mod=1000000007LL;

template<class A=ll> 
void Out(vector<A> a) {REP(i,0,a.size()) {cout<<a[i]<<" ";} cout<<endl;}

template<class A=ll>
void In(vector<A> &a, ll N) {A cur; REP(i,0,N) {cin>>cur; a.pb(cur);}}

class Tree
{
    public:
    ll N; 
    vector<ll> p; 
    vector<vector<ll> > sons;
    vector<vector<ll> > adj;
    ll root;
    vector<bool> visited;
    vector<ll> DFSarr1; //DFS Array
	vector<pl> pos;
    
    Tree(vector<vector<ll> > ad, ll r=0LL)
    {
        N=ad.size(); root=r; adj=ad;
        REP(i,0,N) {visited.pb(false);}
        vector<ll> xx; REP(i,0,N) {sons.pb(xx); p.pb(-1);pos.pb({-1,-1});}
        DFS_Build(r,r);
    }
    
    void Reset()
    {
        REP(i,0,N) {visited[i]=false;}
    }
    
    void DFS_Build(ll s, ll par)
    {
		pos[s].ff=DFSarr1.size();
        DFSarr1.pb(s); 
        p[s]=par;
        visited[s]=true;
        REP(i,0,adj[s].size())
        {
            if(adj[s][i]==par) {continue;}
            sons[s].pb(adj[s][i]);
            DFS_Build(adj[s][i],s);
        }
		pos[s].ss=DFSarr1.size()-1;
        return;
    }
};

vector<ll> label(ll N, ll k, vector<ll> u, vector<ll> v) 
{
	vector<ll> xx; vector<vector<ll> > adj; REP(i,0,N) {adj.pb(xx);}
	REP(i,0,N-1) {adj[u[i]].pb(v[i]); adj[v[i]].pb(u[i]);}
	Tree T(adj); 
	vector<ll> label; 
	ll mil=1000;
	REP(i,0,N) {label.pb(T.pos[i].ff*mil+T.pos[i].ss);}
	return label;
}

ll find_next_station(ll s, ll t, vector<ll> c) 
{
	vector<pl> inter; pl self; pl target;
	ll mil=1000;
	vector<pl> poss;
	self={s/mil,s%mil};
	REP(i,0,c.size()) {inter.pb({c[i]/mil,c[i]%mil});}
	target={t/mil,t%mil}; 
	ll beg = min_element(whole(inter))->ff;
	ll maxend =-1;  ll ind;
	REP(i,0,inter.size()) {if(inter[i].ff==beg && inter[i].ss>maxend) {maxend=inter[i].ss; ind=i;}}
	REP(i,0,inter.size())
	{
		if(i==ind) {continue;}
		if(target.ff>=inter[i].ff && target.ss<=inter[i].ss) {return c[i];}
	}
	return c[ind];
}

Compilation message

stations.cpp: In function 'll find_next_station(ll, ll, std::vector<int>)':
stations.cpp:114:14: warning: 'ind' may be used uninitialized in this function [-Wmaybe-uninitialized]
  114 |  return c[ind];
      |              ^

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 812 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=6009
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 620 KB Invalid labels (values out of range). scenario=0, k=1000, vertex=1, label=1511
2 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 553 ms 1012 KB Output is correct
2 Correct 538 ms 1192 KB Output is correct
3 Correct 1200 ms 868 KB Output is correct
4 Correct 911 ms 760 KB Output is correct
5 Correct 767 ms 868 KB Output is correct
6 Correct 542 ms 1064 KB Output is correct
7 Correct 549 ms 1080 KB Output is correct
8 Correct 4 ms 756 KB Output is correct
9 Correct 5 ms 756 KB Output is correct
10 Correct 2 ms 736 KB Output is correct
11 Correct 611 ms 772 KB Output is correct
12 Correct 558 ms 1056 KB Output is correct
13 Correct 532 ms 1168 KB Output is correct
14 Correct 500 ms 1012 KB Output is correct
15 Correct 52 ms 736 KB Output is correct
16 Correct 90 ms 1052 KB Output is correct
17 Correct 138 ms 1248 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1065 ms 868 KB Output is correct
2 Correct 733 ms 1060 KB Output is correct
3 Correct 687 ms 736 KB Output is correct
4 Correct 3 ms 736 KB Output is correct
5 Correct 4 ms 756 KB Output is correct
6 Correct 3 ms 756 KB Output is correct
7 Correct 694 ms 764 KB Output is correct
8 Correct 1016 ms 868 KB Output is correct
9 Correct 684 ms 736 KB Output is correct
10 Correct 716 ms 756 KB Output is correct
11 Correct 8 ms 864 KB Output is correct
12 Correct 7 ms 756 KB Output is correct
13 Correct 6 ms 872 KB Output is correct
14 Correct 5 ms 904 KB Output is correct
15 Correct 3 ms 756 KB Output is correct
16 Correct 612 ms 736 KB Output is correct
17 Correct 543 ms 1060 KB Output is correct
18 Correct 535 ms 736 KB Output is correct
19 Correct 564 ms 736 KB Output is correct
20 Correct 617 ms 864 KB Output is correct

Subtask #5
26.3205 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 627 ms 1012 KB Partially correct
2 Partially correct 530 ms 1012 KB Partially correct
3 Partially correct 989 ms 1012 KB Partially correct
4 Partially correct 843 ms 1060 KB Partially correct
5 Partially correct 688 ms 756 KB Partially correct
6 Partially correct 484 ms 1012 KB Partially correct
7 Partially correct 466 ms 1220 KB Partially correct
8 Partially correct 4 ms 756 KB Partially correct
9 Partially correct 6 ms 736 KB Partially correct
10 Partially correct 2 ms 736 KB Partially correct
11 Partially correct 508 ms 992 KB Partially correct
12 Partially correct 681 ms 1012 KB Partially correct
13 Partially correct 1057 ms 868 KB Partially correct
14 Partially correct 745 ms 884 KB Partially correct
15 Partially correct 654 ms 868 KB Partially correct
16 Partially correct 503 ms 864 KB Partially correct
17 Partially correct 696 ms 884 KB Partially correct
18 Partially correct 535 ms 1184 KB Partially correct
19 Partially correct 522 ms 1168 KB Partially correct
20 Partially correct 598 ms 1124 KB Partially correct
21 Partially correct 76 ms 840 KB Partially correct
22 Partially correct 81 ms 1052 KB Partially correct
23 Partially correct 130 ms 1128 KB Partially correct
24 Partially correct 6 ms 736 KB Partially correct
25 Partially correct 6 ms 736 KB Partially correct
26 Partially correct 6 ms 736 KB Partially correct
27 Partially correct 4 ms 756 KB Partially correct
28 Partially correct 2 ms 756 KB Partially correct
29 Partially correct 570 ms 736 KB Partially correct
30 Partially correct 590 ms 856 KB Partially correct
31 Partially correct 627 ms 756 KB Partially correct
32 Partially correct 613 ms 864 KB Partially correct
33 Partially correct 581 ms 864 KB Partially correct
34 Partially correct 430 ms 1076 KB Partially correct
35 Partially correct 504 ms 1248 KB Partially correct
36 Partially correct 457 ms 1120 KB Partially correct
37 Partially correct 558 ms 1076 KB Partially correct
38 Partially correct 467 ms 1120 KB Partially correct
39 Partially correct 507 ms 1244 KB Partially correct
40 Partially correct 512 ms 1280 KB Partially correct
41 Partially correct 657 ms 1200 KB Partially correct
42 Partially correct 85 ms 1024 KB Partially correct
43 Partially correct 130 ms 1120 KB Partially correct
44 Partially correct 191 ms 884 KB Partially correct
45 Partially correct 209 ms 1120 KB Partially correct
46 Partially correct 313 ms 900 KB Partially correct
47 Partially correct 390 ms 1236 KB Partially correct
48 Partially correct 73 ms 1204 KB Partially correct
49 Partially correct 68 ms 1120 KB Partially correct