oj.uz

답안 #411853

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
411853 2021-05-26T06:36:04 Z Ruxandra985 Village (BOI20_village) C++14
50 / 100
 87 ms 14432 KB 
#include <bits/stdc++.h>
#define DIMN 100010
using namespace std;
int mini , maxi;
int which[DIMN];
vector <int> v[DIMN];

void dfs (int nod , int tt){
    int i , vecin;

    for (i = 0 ; i < v[nod].size() ; i++){
        vecin = v[nod][i];
        if (vecin != tt)
            dfs (vecin , nod);
    }

    if (which[nod] == nod){ /// nu l ai schimbat inca

        if (tt){
            swap(which[nod] , which[tt]);
            mini += 2;
        }
        else {
            for (i = 0 ; i < v[nod].size() ; i++){
                vecin = v[nod][i];
                if (vecin != tt){

                    swap(which[vecin] , which[nod]);
                    mini += 2;
                    break;

                }
            }
        }

    }

}

int main()
{
    FILE *fin = stdin;
    FILE *fout = stdout;
    int n , x , y , i;
    fscanf (fin,"%d",&n);
    for (i = 1 ; i < n ; i++){
        fscanf (fin,"%d%d",&x,&y);
        v[x].push_back(y);
        v[y].push_back(x);
    }

    /// solve pentru minim

    mini = 0;

    for (i = 1 ; i <= n ; i++){
        which[i] = i; /// ce nod e acum in locul in care se afla nodul i?
    }

    dfs (1 , 0);

    fprintf (fout,"%d 0\n" , mini);

    for (i = 1 ; i <= n ; i++)
        fprintf (fout,"%d ",which[i]);

    fprintf (fout,"\n");

    for (i = 1 ; i <= n ; i++)
        fprintf (fout,"%d ",i);

    return 0;
}

Compilation message

Village.cpp: In function 'void dfs(int, int)':
Village.cpp:11:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |     for (i = 0 ; i < v[nod].size() ; i++){
      |                  ~~^~~~~~~~~~~~~~~
Village.cpp:24:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |             for (i = 0 ; i < v[nod].size() ; i++){
      |                          ~~^~~~~~~~~~~~~~~
Village.cpp: In function 'int main()':
Village.cpp:45:12: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     fscanf (fin,"%d",&n);
      |     ~~~~~~~^~~~~~~~~~~~~
Village.cpp:47:16: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |         fscanf (fin,"%d%d",&x,&y);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 12.0

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

Subtask #2
19.0 / 38.0

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

Subtask #3
25.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 2 ms 2636 KB Partially correct
2 Partially correct 2 ms 2636 KB Partially correct
3 Partially correct 2 ms 2636 KB Partially correct
4 Partially correct 2 ms 2636 KB Partially correct
5 Partially correct 2 ms 2636 KB Partially correct
6 Partially correct 2 ms 2636 KB Partially correct
7 Partially correct 2 ms 2636 KB Partially correct
8 Partially correct 2 ms 2588 KB Partially correct
9 Partially correct 2 ms 2636 KB Partially correct
10 Partially correct 2 ms 2636 KB Partially correct
11 Partially correct 2 ms 2636 KB Partially correct
12 Partially correct 2 ms 2636 KB Partially correct
13 Partially correct 2 ms 2636 KB Partially correct
14 Partially correct 3 ms 2636 KB Partially correct
15 Partially correct 2 ms 2636 KB Partially correct
16 Partially correct 3 ms 2636 KB Partially correct
17 Partially correct 2 ms 2636 KB Partially correct
18 Partially correct 2 ms 2764 KB Partially correct
19 Partially correct 2 ms 2636 KB Partially correct
20 Partially correct 2 ms 2636 KB Partially correct
21 Partially correct 3 ms 2636 KB Partially correct
22 Partially correct 3 ms 2636 KB Partially correct
23 Partially correct 3 ms 2636 KB Partially correct
24 Partially correct 3 ms 2636 KB Partially correct
25 Partially correct 3 ms 2636 KB Partially correct
26 Partially correct 3 ms 2636 KB Partially correct
27 Partially correct 3 ms 2636 KB Partially correct
28 Partially correct 3 ms 2636 KB Partially correct
29 Partially correct 3 ms 2636 KB Partially correct
30 Partially correct 3 ms 2692 KB Partially correct
31 Partially correct 3 ms 2636 KB Partially correct
32 Partially correct 3 ms 2636 KB Partially correct
33 Partially correct 3 ms 2636 KB Partially correct
34 Partially correct 3 ms 2636 KB Partially correct
35 Partially correct 3 ms 2636 KB Partially correct
36 Partially correct 3 ms 2636 KB Partially correct
37 Partially correct 3 ms 2636 KB Partially correct
38 Partially correct 3 ms 2636 KB Partially correct
39 Partially correct 2 ms 2636 KB Partially correct
40 Partially correct 3 ms 2636 KB Partially correct
41 Partially correct 3 ms 2636 KB Partially correct
42 Partially correct 2 ms 2636 KB Partially correct
43 Partially correct 3 ms 2636 KB Partially correct
44 Partially correct 2 ms 2636 KB Partially correct
45 Partially correct 3 ms 2636 KB Partially correct
46 Partially correct 3 ms 2636 KB Partially correct
47 Partially correct 4 ms 2636 KB Partially correct
48 Partially correct 63 ms 7032 KB Partially correct
49 Partially correct 81 ms 7364 KB Partially correct
50 Partially correct 72 ms 8564 KB Partially correct
51 Partially correct 53 ms 7236 KB Partially correct
52 Partially correct 69 ms 8468 KB Partially correct
53 Partially correct 61 ms 7892 KB Partially correct
54 Partially correct 36 ms 8260 KB Partially correct
55 Partially correct 81 ms 14432 KB Partially correct
56 Partially correct 84 ms 11300 KB Partially correct
57 Partially correct 74 ms 10436 KB Partially correct
58 Partially correct 87 ms 9572 KB Partially correct
59 Partially correct 79 ms 8644 KB Partially correct
60 Partially correct 64 ms 8792 KB Partially correct
61 Partially correct 64 ms 8920 KB Partially correct
62 Partially correct 66 ms 8896 KB Partially correct
63 Partially correct 62 ms 8532 KB Partially correct
64 Partially correct 84 ms 8940 KB Partially correct
65 Partially correct 67 ms 8952 KB Partially correct
66 Partially correct 71 ms 8516 KB Partially correct
67 Partially correct 52 ms 7236 KB Partially correct
68 Partially correct 56 ms 7912 KB Partially correct
69 Partially correct 70 ms 9056 KB Partially correct
70 Partially correct 61 ms 8560 KB Partially correct
71 Partially correct 43 ms 6980 KB Partially correct
72 Partially correct 52 ms 7632 KB Partially correct
73 Partially correct 64 ms 9028 KB Partially correct
74 Partially correct 70 ms 8440 KB Partially correct
75 Partially correct 73 ms 8412 KB Partially correct
76 Partially correct 72 ms 8428 KB Partially correct
77 Partially correct 64 ms 8644 KB Partially correct
78 Partially correct 43 ms 6596 KB Partially correct
79 Partially correct 55 ms 7304 KB Partially correct
80 Partially correct 74 ms 8388 KB Partially correct
81 Partially correct 80 ms 8772 KB Partially correct
82 Partially correct 70 ms 8852 KB Partially correct