oj.uz

답안 #604714

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
604714 2022-07-25T09:03:31 Z krit3379 The Xana coup (BOI21_xanadu) C++17
100 / 100
 72 ms 23536 KB 
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define N 100005

long long st[N],dp[2][2][N],ans;
// good/bad  not pass/pass
vector<int> gr[N];

void upd(long long &x,long long &v0,long long &v1,long long &s,long long &m){
    x+=min(v0,v1);
    s^=v0<=v1?0:1;
    m=min(m,abs(v0-v1));
}

void dfs(int s,int f){
    long long b=0,g=0,sb=0,sg=0,mb=1e9,mg=1e9;
    for(auto x:gr[s]){
        if(x==f)continue;
        dfs(x,s);
        upd(b,dp[1][0][x],dp[1][1][x],sb,mb);
        upd(g,dp[0][0][x],dp[0][1][x],sg,mg);
    }
    dp[sg^st[s]][0][s]=min(g,dp[sg^st[s]][0][s]);
    dp[sg^st[s]^1][0][s]=min(g+mg,dp[sg^st[s]^1][0][s]);
    dp[sb^st[s]^1][1][s]=min(b+1,dp[sb^st[s]^1][1][s]);
    dp[sb^st[s]][1][s]=min(b+mb+1,dp[sb^st[s]][1][s]);
}

int main(){
    int n,i,j,k,a,b;
    scanf("%d",&n);
    for(i=1;i<n;i++){
        scanf("%d %d",&a,&b);
        gr[a].push_back(b);
        gr[b].push_back(a);
    }
    for(i=0;i<2;i++)for(j=0;j<2;j++)for(k=1;k<=n;k++)dp[i][j][k]=1e9;
    for(i=1;i<=n;i++)scanf("%d",&st[i]);
    dfs(1,0);
    if(min(dp[0][0][1],dp[0][1][1])<1e9)printf("%d",min(dp[0][0][1],dp[0][1][1]));
    else printf("impossible");
    return 0;
}

Compilation message

xanadu.cpp: In function 'int main()':
xanadu.cpp:40:30: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'long long int*' [-Wformat=]
   40 |     for(i=1;i<=n;i++)scanf("%d",&st[i]);
      |                             ~^  ~~~~~~
      |                              |  |
      |                              |  long long int*
      |                              int*
      |                             %lld
xanadu.cpp:42:50: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
   42 |     if(min(dp[0][0][1],dp[0][1][1])<1e9)printf("%d",min(dp[0][0][1],dp[0][1][1]));
      |                                                 ~^  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
      |                                                  |     |
      |                                                  int   long long int
      |                                                 %lld
xanadu.cpp:33:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
xanadu.cpp:35:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |         scanf("%d %d",&a,&b);
      |         ~~~~~^~~~~~~~~~~~~~~
xanadu.cpp:40:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |     for(i=1;i<=n;i++)scanf("%d",&st[i]);
      |                      ~~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2660 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2660 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 1 ms 2772 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 23440 KB Output is correct
2 Correct 58 ms 23100 KB Output is correct
3 Correct 63 ms 23536 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 23400 KB Output is correct
2 Correct 64 ms 23180 KB Output is correct
3 Correct 59 ms 23532 KB Output is correct
4 Correct 67 ms 10276 KB Output is correct
5 Correct 66 ms 10856 KB Output is correct
6 Correct 68 ms 11080 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 17 ms 5436 KB Output is correct
9 Correct 66 ms 11016 KB Output is correct
10 Correct 65 ms 11132 KB Output is correct
11 Correct 67 ms 11796 KB Output is correct
12 Correct 72 ms 12140 KB Output is correct
13 Correct 56 ms 10492 KB Output is correct
14 Correct 59 ms 10912 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2660 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 1 ms 2772 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 68 ms 23440 KB Output is correct
18 Correct 58 ms 23100 KB Output is correct
19 Correct 63 ms 23536 KB Output is correct
20 Correct 62 ms 23400 KB Output is correct
21 Correct 64 ms 23180 KB Output is correct
22 Correct 59 ms 23532 KB Output is correct
23 Correct 67 ms 10276 KB Output is correct
24 Correct 66 ms 10856 KB Output is correct
25 Correct 68 ms 11080 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 17 ms 5436 KB Output is correct
28 Correct 66 ms 11016 KB Output is correct
29 Correct 65 ms 11132 KB Output is correct
30 Correct 67 ms 11796 KB Output is correct
31 Correct 72 ms 12140 KB Output is correct
32 Correct 56 ms 10492 KB Output is correct
33 Correct 59 ms 10912 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 1 ms 2644 KB Output is correct
36 Correct 2 ms 2664 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2620 KB Output is correct
39 Correct 1 ms 2644 KB Output is correct
40 Correct 1 ms 2664 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 61 ms 23436 KB Output is correct
46 Correct 62 ms 23200 KB Output is correct
47 Correct 58 ms 23524 KB Output is correct
48 Correct 54 ms 10064 KB Output is correct
49 Correct 61 ms 10828 KB Output is correct
50 Correct 62 ms 11028 KB Output is correct
51 Correct 2 ms 2644 KB Output is correct
52 Correct 17 ms 5528 KB Output is correct
53 Correct 69 ms 10944 KB Output is correct
54 Correct 70 ms 11084 KB Output is correct
55 Correct 65 ms 11840 KB Output is correct
56 Correct 67 ms 12104 KB Output is correct
57 Correct 56 ms 10632 KB Output is correct
58 Correct 62 ms 10956 KB Output is correct
59 Correct 17 ms 5396 KB Output is correct
60 Correct 52 ms 10196 KB Output is correct
61 Correct 62 ms 10932 KB Output is correct
62 Correct 64 ms 11112 KB Output is correct
63 Correct 60 ms 11092 KB Output is correct
64 Correct 66 ms 11084 KB Output is correct
65 Correct 54 ms 11484 KB Output is correct
66 Correct 55 ms 11488 KB Output is correct
67 Correct 46 ms 11352 KB Output is correct
68 Correct 65 ms 11380 KB Output is correct
69 Correct 51 ms 11396 KB Output is correct
70 Correct 46 ms 11360 KB Output is correct