oj.uz

답안 #129603

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
129603 2019-07-12T18:36:07 Z davitmarg Railway (BOI17_railway) C++17
100 / 100
 449 ms 56176 KB 
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <stack>
#include <cassert>
#include <iterator>
#include <bitset>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(),v.end()
using namespace std;

map<pair<int,int>,int> num;
int n,k,m,cnt[50004],f[200005],mns;
vector<int> g[200005],ans;
vector<pair<int,int>> t;
map<int,int> s[200005];


void dfs(int v,int p=0)
{
    for(auto it=s[v].begin();it!=s[v].end();++it)
        f[v]+=(it->second==cnt[it->first]);
    for(int i=0;i<g[v].size();i++)
	{
		int to=g[v][i];
        if(to==p)
			continue;
		dfs(to,v);
        if(s[v].size()<s[to].size())
		{
            swap(s[v],s[to]);
            swap(f[v],f[to]);
		}
        for(auto it=s[to].begin();it!=s[to].end();++it)
		{
            s[v][it->first]+=it->second;
			if(s[v][it->first]==cnt[it->first])
				f[v]++;
		}
	}
    if(s[v].size()-f[v]>=k)
		ans.PB(num[MP(v,p)]);
}

int main()
{
    cin >> n >> m >> k;
    for(int i=1;i<=n-1;i++)
	{
        int a,b;
        scanf("%d%d",&a,&b);
        g[a].PB(b);
        g[b].PB(a);
        num[MP(a,b)]=num[MP(b,a)]=i;
	}

    for(int i=1;i<=m;i++)
	{
		int c,v;
		scanf("%d",&c);
        cnt[i]=c;
        while(c--)
		{
			scanf("%d",&v);
            s[v][i]++;
		}
	}
    dfs(1);
    cout<<ans.size()<<endl;
    sort(all(ans));
    for(int i=0;i<ans.size();i++)
        printf("%d ",ans[i]);
    cout<<endl;
	return 0;
}


/*

2 2 2
1 2
2 1 2
2 2 1


*/

Compilation message

railway.cpp: In function 'void dfs(int, int)':
railway.cpp:36:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<g[v].size();i++)
                 ~^~~~~~~~~~~~
railway.cpp:54:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(s[v].size()-f[v]>=k)
        ~~~~~~~~~~~~~~~~^~~
railway.cpp: In function 'int main()':
railway.cpp:84:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<ans.size();i++)
                 ~^~~~~~~~~~~
railway.cpp:64:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&a,&b);
         ~~~~~^~~~~~~~~~~~~~
railway.cpp:73:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&c);
   ~~~~~^~~~~~~~~
railway.cpp:77:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&v);
    ~~~~~^~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 27 ms 16248 KB Output is correct
3 Correct 28 ms 16380 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 15 ms 14456 KB Output is correct
6 Correct 27 ms 16888 KB Output is correct
7 Correct 28 ms 16376 KB Output is correct
8 Correct 25 ms 16376 KB Output is correct
9 Correct 27 ms 16376 KB Output is correct
10 Correct 14 ms 14456 KB Output is correct
11 Correct 14 ms 14456 KB Output is correct
12 Correct 14 ms 14456 KB Output is correct
13 Correct 14 ms 14456 KB Output is correct
14 Correct 15 ms 14428 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 27 ms 16248 KB Output is correct
3 Correct 28 ms 16380 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 15 ms 14456 KB Output is correct
6 Correct 27 ms 16888 KB Output is correct
7 Correct 28 ms 16376 KB Output is correct
8 Correct 25 ms 16376 KB Output is correct
9 Correct 27 ms 16376 KB Output is correct
10 Correct 14 ms 14456 KB Output is correct
11 Correct 14 ms 14456 KB Output is correct
12 Correct 14 ms 14456 KB Output is correct
13 Correct 14 ms 14456 KB Output is correct
14 Correct 15 ms 14428 KB Output is correct
15 Correct 89 ms 22008 KB Output is correct
16 Correct 90 ms 22132 KB Output is correct
17 Correct 95 ms 22168 KB Output is correct
18 Correct 29 ms 17144 KB Output is correct
19 Correct 29 ms 16376 KB Output is correct
20 Correct 98 ms 21492 KB Output is correct
21 Correct 130 ms 21340 KB Output is correct
22 Correct 15 ms 14456 KB Output is correct
23 Correct 28 ms 16248 KB Output is correct
24 Correct 28 ms 16248 KB Output is correct
25 Correct 14 ms 14456 KB Output is correct
26 Correct 15 ms 14456 KB Output is correct
27 Correct 28 ms 16916 KB Output is correct
28 Correct 33 ms 16376 KB Output is correct
29 Correct 33 ms 16376 KB Output is correct
30 Correct 28 ms 16504 KB Output is correct
31 Correct 15 ms 14456 KB Output is correct
32 Correct 15 ms 14456 KB Output is correct
33 Correct 15 ms 14556 KB Output is correct
34 Correct 17 ms 14584 KB Output is correct
35 Correct 15 ms 14456 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 282 ms 51064 KB Output is correct
2 Correct 14 ms 14460 KB Output is correct
3 Correct 321 ms 52468 KB Output is correct
4 Correct 254 ms 52088 KB Output is correct
5 Correct 252 ms 50612 KB Output is correct
6 Correct 355 ms 53108 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 306 ms 44524 KB Output is correct
2 Correct 348 ms 43644 KB Output is correct
3 Correct 375 ms 48252 KB Output is correct
4 Correct 385 ms 47992 KB Output is correct
5 Correct 381 ms 48548 KB Output is correct
6 Correct 300 ms 46456 KB Output is correct
7 Correct 299 ms 46208 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 306 ms 44524 KB Output is correct
2 Correct 348 ms 43644 KB Output is correct
3 Correct 375 ms 48252 KB Output is correct
4 Correct 385 ms 47992 KB Output is correct
5 Correct 381 ms 48548 KB Output is correct
6 Correct 300 ms 46456 KB Output is correct
7 Correct 299 ms 46208 KB Output is correct
8 Correct 269 ms 45176 KB Output is correct
9 Correct 268 ms 45048 KB Output is correct
10 Correct 248 ms 50508 KB Output is correct
11 Correct 243 ms 50552 KB Output is correct
12 Correct 207 ms 36956 KB Output is correct
13 Correct 213 ms 37020 KB Output is correct
14 Correct 347 ms 43000 KB Output is correct
15 Correct 330 ms 43200 KB Output is correct
16 Correct 391 ms 49024 KB Output is correct
17 Correct 387 ms 49376 KB Output is correct
18 Correct 383 ms 47244 KB Output is correct
19 Correct 426 ms 44540 KB Output is correct
20 Correct 328 ms 46632 KB Output is correct
21 Correct 301 ms 46672 KB Output is correct
22 Correct 294 ms 46780 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 27 ms 16248 KB Output is correct
3 Correct 28 ms 16380 KB Output is correct
4 Correct 15 ms 14456 KB Output is correct
5 Correct 15 ms 14456 KB Output is correct
6 Correct 27 ms 16888 KB Output is correct
7 Correct 28 ms 16376 KB Output is correct
8 Correct 25 ms 16376 KB Output is correct
9 Correct 27 ms 16376 KB Output is correct
10 Correct 14 ms 14456 KB Output is correct
11 Correct 14 ms 14456 KB Output is correct
12 Correct 14 ms 14456 KB Output is correct
13 Correct 14 ms 14456 KB Output is correct
14 Correct 15 ms 14428 KB Output is correct
15 Correct 89 ms 22008 KB Output is correct
16 Correct 90 ms 22132 KB Output is correct
17 Correct 95 ms 22168 KB Output is correct
18 Correct 29 ms 17144 KB Output is correct
19 Correct 29 ms 16376 KB Output is correct
20 Correct 98 ms 21492 KB Output is correct
21 Correct 130 ms 21340 KB Output is correct
22 Correct 15 ms 14456 KB Output is correct
23 Correct 28 ms 16248 KB Output is correct
24 Correct 28 ms 16248 KB Output is correct
25 Correct 14 ms 14456 KB Output is correct
26 Correct 15 ms 14456 KB Output is correct
27 Correct 28 ms 16916 KB Output is correct
28 Correct 33 ms 16376 KB Output is correct
29 Correct 33 ms 16376 KB Output is correct
30 Correct 28 ms 16504 KB Output is correct
31 Correct 15 ms 14456 KB Output is correct
32 Correct 15 ms 14456 KB Output is correct
33 Correct 15 ms 14556 KB Output is correct
34 Correct 17 ms 14584 KB Output is correct
35 Correct 15 ms 14456 KB Output is correct
36 Correct 282 ms 51064 KB Output is correct
37 Correct 14 ms 14460 KB Output is correct
38 Correct 321 ms 52468 KB Output is correct
39 Correct 254 ms 52088 KB Output is correct
40 Correct 252 ms 50612 KB Output is correct
41 Correct 355 ms 53108 KB Output is correct
42 Correct 306 ms 44524 KB Output is correct
43 Correct 348 ms 43644 KB Output is correct
44 Correct 375 ms 48252 KB Output is correct
45 Correct 385 ms 47992 KB Output is correct
46 Correct 381 ms 48548 KB Output is correct
47 Correct 300 ms 46456 KB Output is correct
48 Correct 299 ms 46208 KB Output is correct
49 Correct 269 ms 45176 KB Output is correct
50 Correct 268 ms 45048 KB Output is correct
51 Correct 248 ms 50508 KB Output is correct
52 Correct 243 ms 50552 KB Output is correct
53 Correct 207 ms 36956 KB Output is correct
54 Correct 213 ms 37020 KB Output is correct
55 Correct 347 ms 43000 KB Output is correct
56 Correct 330 ms 43200 KB Output is correct
57 Correct 391 ms 49024 KB Output is correct
58 Correct 387 ms 49376 KB Output is correct
59 Correct 383 ms 47244 KB Output is correct
60 Correct 426 ms 44540 KB Output is correct
61 Correct 328 ms 46632 KB Output is correct
62 Correct 301 ms 46672 KB Output is correct
63 Correct 294 ms 46780 KB Output is correct
64 Correct 263 ms 46364 KB Output is correct
65 Correct 437 ms 56176 KB Output is correct
66 Correct 449 ms 50536 KB Output is correct
67 Correct 335 ms 46072 KB Output is correct
68 Correct 211 ms 35600 KB Output is correct
69 Correct 257 ms 35672 KB Output is correct
70 Correct 348 ms 46820 KB Output is correct
71 Correct 254 ms 44940 KB Output is correct
72 Correct 15 ms 14456 KB Output is correct
73 Correct 28 ms 16248 KB Output is correct
74 Correct 28 ms 16248 KB Output is correct
75 Correct 18 ms 14456 KB Output is correct
76 Correct 15 ms 14456 KB Output is correct
77 Correct 27 ms 16888 KB Output is correct
78 Correct 27 ms 16376 KB Output is correct
79 Correct 25 ms 16376 KB Output is correct
80 Correct 28 ms 16504 KB Output is correct
81 Correct 18 ms 14456 KB Output is correct
82 Correct 19 ms 14456 KB Output is correct
83 Correct 14 ms 14456 KB Output is correct
84 Correct 14 ms 14456 KB Output is correct
85 Correct 14 ms 14456 KB Output is correct
86 Correct 92 ms 22136 KB Output is correct
87 Correct 87 ms 22136 KB Output is correct
88 Correct 90 ms 22108 KB Output is correct
89 Correct 29 ms 17144 KB Output is correct
90 Correct 28 ms 16632 KB Output is correct
91 Correct 89 ms 21496 KB Output is correct
92 Correct 97 ms 21368 KB Output is correct
93 Correct 15 ms 14456 KB Output is correct
94 Correct 286 ms 52876 KB Output is correct
95 Correct 270 ms 52472 KB Output is correct
96 Correct 288 ms 52072 KB Output is correct
97 Correct 247 ms 50548 KB Output is correct
98 Correct 278 ms 53244 KB Output is correct
99 Correct 401 ms 51508 KB Output is correct
100 Correct 392 ms 48920 KB Output is correct
101 Correct 391 ms 49272 KB Output is correct
102 Correct 393 ms 44148 KB Output is correct
103 Correct 287 ms 46428 KB Output is correct
104 Correct 318 ms 46708 KB Output is correct
105 Correct 285 ms 46332 KB Output is correct
106 Correct 270 ms 45200 KB Output is correct
107 Correct 269 ms 45176 KB Output is correct
108 Correct 230 ms 50544 KB Output is correct
109 Correct 231 ms 50720 KB Output is correct
110 Correct 198 ms 36988 KB Output is correct
111 Correct 196 ms 36952 KB Output is correct
112 Correct 326 ms 42744 KB Output is correct
113 Correct 354 ms 42792 KB Output is correct