CSES - KILO 2015 4/5

Submission details
Task:	Bus lines
Sender:	Team Purkka
Submission time:	2015-09-30 17:00:08 +0300
Language:	C++
Status:	READY
Result:	TIME LIMIT EXCEEDED

Test results
test	verdict	time
#1	TIME LIMIT EXCEEDED	--	details
#2	TIME LIMIT EXCEEDED	--	details
#3	TIME LIMIT EXCEEDED	--	details
#4	TIME LIMIT EXCEEDED	--	details
#5	TIME LIMIT EXCEEDED	--	details
#6	TIME LIMIT EXCEEDED	--	details
#7	TIME LIMIT EXCEEDED	--	details
#8	TIME LIMIT EXCEEDED	--	details
#9	TIME LIMIT EXCEEDED	--	details
#10	TIME LIMIT EXCEEDED	--	details
#11	TIME LIMIT EXCEEDED	--	details
#12	TIME LIMIT EXCEEDED	--	details
#13	TIME LIMIT EXCEEDED	--	details
#14	TIME LIMIT EXCEEDED	--	details
#15	TIME LIMIT EXCEEDED	--	details
#16	TIME LIMIT EXCEEDED	--	details
#17	TIME LIMIT EXCEEDED	--	details
#18	TIME LIMIT EXCEEDED	--	details
#19	TIME LIMIT EXCEEDED	--	details
#20	TIME LIMIT EXCEEDED	--	details
#21	TIME LIMIT EXCEEDED	--	details
#22	TIME LIMIT EXCEEDED	--	details
#23	TIME LIMIT EXCEEDED	--	details
#24	TIME LIMIT EXCEEDED	--	details
#25	TIME LIMIT EXCEEDED	--	details

Code

#include <iostream>
#include <list>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

typedef pair<int,int> pint;
typedef vector<int> vint;

struct yht{
	int a,b;
	yht(){}
	yht(int na,int nb):a(na),b(nb){}
};

int main()
{
	cin.sync_with_stdio(false);	
	
	int n,m,k;
	cin>>n>>m>>k;
	vint l[n];
	vector<yht> y;
	for(int i=0;i<m;i++){
		int a,b;
		cin>>a>>b;
		a--;b--;
		l[a].push_back(b);
		l[b].push_back(a);
		y.push_back(yht(a,b));
	}
	int v[n];
	list<pint> q;
	int s;
	for(int _=0;_<k;_++){
		int w;
		cin>>w;
		const yht g=y[w-1];
		for(vint::iterator j=l[g.a].begin();j!=l[g.a].end();j++)
			if(*j==g.b){*j=-1;break;}
		for(vint::iterator j=l[g.b].begin();j!=l[g.b].end();j++)
			if(*j==g.a){*j=-1;break;}
		s=0;
		for(int i=0;i<n;i++){q.push_back(make_pair(i,-1));v[i]=0;}
		int n=0;
		while(!q.empty()){
			const pint o=q.front();
			q.pop_front();
			if(v[o.first])continue;
			int r=o.second==-1?++n:o.second;
			v[o.first]=r;
			s=max(r,s);
			for(vint::iterator j=l[o.first].begin();j!=l[o.first].end();j++){
				if(*j!=-1)q.push_front(make_pair(*j,r));
			}
		}
		cout<<s<<' ';
	}
	cout<<endl;
	return 0;
}

Test details

Test 1

Verdict: TIME LIMIT EXCEEDED

input
`42712 59669 3327 27393 5935 40762 40800 33005 34639 19131 2850 ...` view save

correct output
`2937 2937 2937 2937 2937 2938 ...` view save

user output
(empty)

Test 2

Verdict: TIME LIMIT EXCEEDED

input
`76287 96164 41787 58072 25022 46787 62110 30339 48282 73612 52159 ...` view save

correct output
`6969 6969 6969 6969 6970 6970 ...` view save

user output
(empty)

Test 3

Verdict: TIME LIMIT EXCEEDED

input
`18336 40887 13506 13131 7525 2330 5108 1053 8852 2934 4194 ...` view save

correct output
`208 208 208 208 208 208 208 20...` view save

user output
(empty)

Test 4

Verdict: TIME LIMIT EXCEEDED

input
`10251 91042 26842 3863 3691 4990 6580 3722 1896 1240 6558 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
(empty)

Test 5

Verdict: TIME LIMIT EXCEEDED

input
`75339 65466 44858 37059 62665 14790 65885 12864 58973 70022 19675 ...` view save

correct output
`16333 16334 16335 16336 16336 ...` view save

user output
(empty)

Test 6

Verdict: TIME LIMIT EXCEEDED

input
`2086 66519 52411 361 1822 723 1145 1914 914 2075 1759 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
(empty)

Test 7

Verdict: TIME LIMIT EXCEEDED

input
`38126 95132 68427 15424 17170 2781 12706 33834 13802 13405 25848 ...` view save

correct output
`246 246 246 246 246 246 246 24...` view save

user output
(empty)

Test 8

Verdict: TIME LIMIT EXCEEDED

input
`13057 86973 49052 5610 4743 1062 7853 6391 10993 5814 10957 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
(empty)

Test 9

Verdict: TIME LIMIT EXCEEDED

input
`88876 29498 13976 16610 72903 2735 47496 44512 709 3413 60896 ...` view save

correct output
`59380 59381 59382 59383 59384 ...` view save

user output
(empty)

Test 10

Verdict: TIME LIMIT EXCEEDED

input
`54386 40792 30938 11372 35684 36569 35851 24804 11443 2433 7140 ...` view save

correct output
`15500 15501 15502 15502 15503 ...` view save

user output
(empty)

Test 11

Verdict: TIME LIMIT EXCEEDED

input
`18637 33277 33188 6803 17956 14954 12901 7331 13934 15280 6584 ...` view save

correct output
`560 560 560 561 561 561 561 56...` view save

user output
(empty)

Test 12

Verdict: TIME LIMIT EXCEEDED

input
`2637 72943 18160 897 1538 720 703 1919 2314 1803 1644 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
(empty)

Test 13

Verdict: TIME LIMIT EXCEEDED

input
`100000 100000 100000 87033 99257 40607 9856 32664 94458 61822 19892 ...` view save

correct output
`16212 16212 16212 16213 16213 ...` view save

user output
(empty)

Test 14

Verdict: TIME LIMIT EXCEEDED

input
`100000 100000 100000 4621 68476 54853 81760 28147 87423 33351 48197 ...` view save

correct output
`16294 16295 16295 16295 16296 ...` view save

user output
(empty)

Test 15

Verdict: TIME LIMIT EXCEEDED

input
`100000 100000 100000 51596 84775 65582 47330 87748 35647 53679 16442 ...` view save

correct output
`16120 16121 16122 16122 16123 ...` view save

user output
(empty)

Test 16

Verdict: TIME LIMIT EXCEEDED

input
`100000 100000 100000 69292 26196 54314 63616 95 16072 19077 67875 ...` view save

correct output
`16149 16149 16149 16149 16150 ...` view save

user output
(empty)

Test 17

Verdict: TIME LIMIT EXCEEDED

input
`100000 100000 100000 97541 89807 88261 42118 68387 12007 50630 50 ...` view save

correct output
`16105 16105 16105 16105 16106 ...` view save

user output
(empty)

Test 18

Verdict: TIME LIMIT EXCEEDED

input
`100000 100000 100000 91853 52153 10866 98151 37463 6198 60814 65027 ...` view save

correct output
`16154 16155 16155 16155 16156 ...` view save

user output
(empty)

Test 19

Verdict: TIME LIMIT EXCEEDED

input
`100000 100000 100000 40682 32628 80240 43316 2162 93003 59820 88267 ...` view save

correct output
`16398 16398 16398 16398 16398 ...` view save

user output
(empty)

Test 20

Verdict: TIME LIMIT EXCEEDED

input
`100000 100000 100000 55437 43499 70984 56856 86259 35090 95150 56215 ...` view save

correct output
`16044 16045 16045 16045 16046 ...` view save

user output
(empty)

Test 21

Verdict: TIME LIMIT EXCEEDED

input
`100000 100000 100000 4134 98627 66480 41168 90133 75501 94062 11019 ...` view save

correct output
`16251 16252 16252 16252 16253 ...` view save

user output
(empty)

Test 22

Verdict: TIME LIMIT EXCEEDED

input
`100000 100000 100000 6352 451 19430 47543 18870 69498 10423 18161 ...` view save

correct output
`16118 16118 16118 16119 16119 ...` view save

user output
(empty)

Test 23

Verdict: TIME LIMIT EXCEEDED

input
`100000 100000 100000 47553 72232 19034 64055 24491 39922 98399 16192 ...` view save

correct output
`16199 16200 16201 16202 16202 ...` view save

user output
(empty)

Test 24

Verdict: TIME LIMIT EXCEEDED

input
`100000 100000 100000 69140 89073 95544 9460 45106 70799 50772 94371 ...` view save

correct output
`16196 16196 16197 16198 16198 ...` view save

user output
(empty)

Test 25

Verdict: TIME LIMIT EXCEEDED

input
`100000 100000 100000 22639 28340 10882 29245 74076 54240 87341 51204 ...` view save

correct output
`16129 16129 16129 16129 16129 ...` view save

user output
(empty)

KILO 2015 4/5

Bus lines

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Tasks

Submissions (Team Purkka)