oj.uz

답안 #342978

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
342978 2021-01-03T10:10:57 Z leinad2 Village (BOI20_village) C++17
50 / 100
 115 ms 18028 KB 
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n, i, j, k, a, b, ans[100010], A[100010], res, cent, sz[100010], dep[100010], in[100010], revin[100010], cnt;
vector<int>adj[100010];
void dfs(int v, int par, int depth)
{
    in[v]=++cnt;
    dep[v]=depth;
    sz[v]=1;
    for(int i=0;i<adj[v].size();i++)
    {
        int p=adj[v][i];
        if(p==par)continue;
        dfs(p, v, depth+1);
        sz[v]+=sz[p];
    }
}
int centroid(int v, int par)
{
    for(int i=0;i<adj[v].size();i++)
    {
        int p=adj[v][i];
        if(p==par)continue;
        if(sz[p]*2>n)
        {
            return centroid(p, v);
        }
    }
    return v;
}
int f(int x)
{
    return ((x+(n/2))%n==0?n:(x+(n/2))%n);
}
main()
{
    for(scanf("%lld", &n);++i<n;)
    {
        scanf("%lld %lld", &a, &b);
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    dfs(1, 0, 0);
    cent=centroid(1, 0);
    cnt=0;
    dfs(cent, 0, 0);
    for(i=0;i++<n;)res+=dep[i]*2;
    for(i=0;i++<n;)
    {
        revin[in[i]]=i;
    }
    for(i=0;i++<n;)
    {
        ans[revin[i]]=revin[f(i)];
    }
    printf("1 %lld\n", res);
    for(i=0;i++<n;)printf("1 ");
    puts("");
    for(i=0;i++<n;)
    {
        printf("%lld ", ans[i]);
    }
}

Compilation message

Village.cpp: In function 'void dfs(long long int, long long int, long long int)':
Village.cpp:11:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |     for(int i=0;i<adj[v].size();i++)
      |                 ~^~~~~~~~~~~~~~
Village.cpp: In function 'long long int centroid(long long int, long long int)':
Village.cpp:21:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     for(int i=0;i<adj[v].size();i++)
      |                 ~^~~~~~~~~~~~~~
Village.cpp: At global scope:
Village.cpp:36:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   36 | main()
      |      ^
Village.cpp: In function 'int main()':
Village.cpp:38:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   38 |     for(scanf("%lld", &n);++i<n;)
      |         ~~~~~^~~~~~~~~~~~
Village.cpp:40:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   40 |         scanf("%lld %lld", &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 2 ms 2668 KB Partially correct
2 Partially correct 2 ms 2668 KB Partially correct
3 Partially correct 2 ms 2668 KB Partially correct
4 Partially correct 2 ms 2668 KB Partially correct
5 Partially correct 2 ms 2668 KB Partially correct
6 Partially correct 2 ms 2668 KB Partially correct
7 Partially correct 2 ms 2668 KB Partially correct
8 Partially correct 2 ms 2668 KB Partially correct
9 Partially correct 2 ms 2668 KB Partially correct
10 Partially correct 2 ms 2668 KB Partially correct
11 Partially correct 2 ms 2668 KB Partially correct
12 Partially correct 2 ms 2668 KB Partially correct
13 Partially correct 2 ms 2668 KB Partially correct
14 Partially correct 2 ms 2668 KB Partially correct
15 Partially correct 2 ms 2668 KB Partially correct
16 Partially correct 2 ms 2688 KB Partially correct
17 Partially correct 2 ms 2668 KB Partially correct

Subtask #2
19.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 2 ms 2668 KB Partially correct
2 Partially correct 2 ms 2796 KB Partially correct
3 Partially correct 2 ms 2796 KB Partially correct
4 Partially correct 2 ms 2796 KB Partially correct
5 Partially correct 2 ms 2796 KB Partially correct
6 Partially correct 3 ms 2796 KB Partially correct
7 Partially correct 3 ms 2796 KB Partially correct
8 Partially correct 2 ms 2796 KB Partially correct
9 Partially correct 2 ms 2816 KB Partially correct
10 Partially correct 3 ms 2796 KB Partially correct
11 Partially correct 2 ms 2796 KB Partially correct
12 Partially correct 2 ms 2796 KB Partially correct
13 Partially correct 2 ms 2796 KB Partially correct
14 Partially correct 2 ms 2796 KB Partially correct
15 Partially correct 2 ms 2796 KB Partially correct
16 Partially correct 2 ms 2796 KB Partially correct
17 Partially correct 3 ms 2796 KB Partially correct
18 Partially correct 2 ms 2796 KB Partially correct
19 Partially correct 2 ms 2796 KB Partially correct
20 Partially correct 2 ms 2796 KB Partially correct
21 Partially correct 2 ms 2796 KB Partially correct
22 Partially correct 2 ms 2796 KB Partially correct
23 Partially correct 2 ms 2816 KB Partially correct
24 Partially correct 2 ms 2796 KB Partially correct
25 Partially correct 2 ms 2796 KB Partially correct
26 Partially correct 2 ms 2816 KB Partially correct
27 Partially correct 2 ms 2796 KB Partially correct
28 Partially correct 2 ms 2796 KB Partially correct
29 Partially correct 2 ms 2796 KB Partially correct
30 Partially correct 2 ms 2796 KB Partially correct

Subtask #3
25.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 2 ms 2668 KB Partially correct
2 Partially correct 2 ms 2668 KB Partially correct
3 Partially correct 2 ms 2668 KB Partially correct
4 Partially correct 2 ms 2668 KB Partially correct
5 Partially correct 2 ms 2668 KB Partially correct
6 Partially correct 2 ms 2668 KB Partially correct
7 Partially correct 2 ms 2668 KB Partially correct
8 Partially correct 2 ms 2668 KB Partially correct
9 Partially correct 2 ms 2668 KB Partially correct
10 Partially correct 2 ms 2668 KB Partially correct
11 Partially correct 2 ms 2668 KB Partially correct
12 Partially correct 2 ms 2668 KB Partially correct
13 Partially correct 2 ms 2668 KB Partially correct
14 Partially correct 2 ms 2668 KB Partially correct
15 Partially correct 2 ms 2668 KB Partially correct
16 Partially correct 2 ms 2688 KB Partially correct
17 Partially correct 2 ms 2668 KB Partially correct
18 Partially correct 2 ms 2668 KB Partially correct
19 Partially correct 2 ms 2796 KB Partially correct
20 Partially correct 2 ms 2796 KB Partially correct
21 Partially correct 2 ms 2796 KB Partially correct
22 Partially correct 2 ms 2796 KB Partially correct
23 Partially correct 3 ms 2796 KB Partially correct
24 Partially correct 3 ms 2796 KB Partially correct
25 Partially correct 2 ms 2796 KB Partially correct
26 Partially correct 2 ms 2816 KB Partially correct
27 Partially correct 3 ms 2796 KB Partially correct
28 Partially correct 2 ms 2796 KB Partially correct
29 Partially correct 2 ms 2796 KB Partially correct
30 Partially correct 2 ms 2796 KB Partially correct
31 Partially correct 2 ms 2796 KB Partially correct
32 Partially correct 2 ms 2796 KB Partially correct
33 Partially correct 2 ms 2796 KB Partially correct
34 Partially correct 3 ms 2796 KB Partially correct
35 Partially correct 2 ms 2796 KB Partially correct
36 Partially correct 2 ms 2796 KB Partially correct
37 Partially correct 2 ms 2796 KB Partially correct
38 Partially correct 2 ms 2796 KB Partially correct
39 Partially correct 2 ms 2796 KB Partially correct
40 Partially correct 2 ms 2816 KB Partially correct
41 Partially correct 2 ms 2796 KB Partially correct
42 Partially correct 2 ms 2796 KB Partially correct
43 Partially correct 2 ms 2816 KB Partially correct
44 Partially correct 2 ms 2796 KB Partially correct
45 Partially correct 2 ms 2796 KB Partially correct
46 Partially correct 2 ms 2796 KB Partially correct
47 Partially correct 2 ms 2796 KB Partially correct
48 Partially correct 79 ms 10476 KB Partially correct
49 Partially correct 91 ms 11244 KB Partially correct
50 Partially correct 92 ms 11116 KB Partially correct
51 Partially correct 70 ms 9324 KB Partially correct
52 Partially correct 96 ms 11116 KB Partially correct
53 Partially correct 77 ms 10348 KB Partially correct
54 Partially correct 45 ms 10092 KB Partially correct
55 Partially correct 115 ms 18028 KB Partially correct
56 Partially correct 113 ms 15724 KB Partially correct
57 Partially correct 105 ms 14572 KB Partially correct
58 Partially correct 107 ms 13548 KB Partially correct
59 Partially correct 90 ms 12396 KB Partially correct
60 Partially correct 63 ms 12384 KB Partially correct
61 Partially correct 70 ms 12508 KB Partially correct
62 Partially correct 76 ms 12652 KB Partially correct
63 Partially correct 75 ms 12012 KB Partially correct
64 Partially correct 84 ms 12652 KB Partially correct
65 Partially correct 76 ms 12780 KB Partially correct
66 Partially correct 71 ms 12012 KB Partially correct
67 Partially correct 49 ms 9960 KB Partially correct
68 Partially correct 64 ms 11244 KB Partially correct
69 Partially correct 78 ms 12908 KB Partially correct
70 Partially correct 87 ms 12268 KB Partially correct
71 Partially correct 49 ms 9708 KB Partially correct
72 Partially correct 58 ms 10732 KB Partially correct
73 Partially correct 83 ms 12908 KB Partially correct
74 Partially correct 71 ms 12012 KB Partially correct
75 Partially correct 97 ms 12780 KB Partially correct
76 Partially correct 89 ms 12140 KB Partially correct
77 Partially correct 86 ms 12524 KB Partially correct
78 Partially correct 52 ms 9324 KB Partially correct
79 Partially correct 60 ms 10220 KB Partially correct
80 Partially correct 103 ms 12908 KB Partially correct
81 Partially correct 79 ms 12652 KB Partially correct
82 Partially correct 79 ms 12652 KB Partially correct