oj.uz

Submission #810793

# Submission time Handle Problem Language Result Execution time Memory
810793 2023-08-06T15:23:08 Z huynhyen1609 Logičari (COCI21_logicari) C++14
110 / 110
 192 ms 32852 KB 
/*
                                 ..
                        .:^!7?JJJYJJJJ?77!!~^.
                   .:~7JYYJYYJJ?77?J??JY?JYY5YY?7~:.
                 :!J5YJ??777J?J?????7J?J?7J?J?JYYYYY?~.
               :?5JJ???77!?77?J??J7?7???JJJJ?J777??JYJY?!.
             ^J5YYJJJ77?!7!7!77JJJJ?J77??Y???77!!777!7?JY5?^
           ~JYY??J7??7J?7?!7!7???J?77!777J?JY?J7777?7?????5PY^
         ^Y5J??J??!!???J??77777????J?J77?YY?!~^::::::^!77??YPG7.
        !PY?777?77!7!7J?7!7?????JJ??7J??J^:.           .:!7?75GY:
      .JPJ!7!7?7?7!7!????????J?7??7J?YJ~.                .:!7?JGP^
     .JP?!7!!??7J7!!!?7J????7J7!!?!?7?7.                 .  ^??YG5:
     !P??7777?77??777?7?!7!777!?7J??J?^              :~~:  . ^?7YGY.
    :PY7??77!7~~:::.....:^^~!7??????J?^        .   .7PGGPY: . !?JPB~
   .Y5!!Y77!~:..            .:~7JJJ??J!.       . . .5GGGGP^ ..:J?JBJ
   ~G?!!?7!^.                  .^7JJYYJ7:.      . ..:~???~^^:..77?G5.
   !G!7?77:                     ..?J7~^~!77: .  .. ..^~~~~~~~:.!75B!
   !P77J7^                     ..~?:::^~!7?^ ........^~^^^^^:.^JYG?.
   !G???!:      .~77!:.        ..7?7?77~:....................^JPJ~
   :P5??7:     .JGGGGP!        ......  ..................:^!JP?^
    7BJ7J~     .JGGGGG~       . .....................::::^!7?JJ?!^.
    .YG?Y7^     .~7??~:::.     ..  .... ... ....::::::::::::^?~^!?J7:
     :PPJ??:    ..:^^^^^^:     .  .... ....::::^::::::::.:::^JP~..:75~
      :YGYJ?^.  .^^^^^^^:.        .....:::::::::::...:::..:.::JP!~~7Y~
        ~PP5J?^...::::.... ......::::::::.:.::.:::::.:::::::::^JP?7~.
         :75P5YJ!~^^^^!:...::^:::::::...:......::.....::::::::^^5?
           ?G?Y55PP5YJ!^:::::::::..:..:.:....:...:....::..::::^^7G^
           ~P!^:::::.::::::::::::::...:.::::.:.:::::.:.......:::^PY
            :!JJ7~^::::::::::::::::..:.:.::.:::::...::.........:.JP.
               :5P?^:^:::::^::::::::::::.::::::.:.::.::........::7P:
               .P7::::::::::^::^^::::::::::::::::.:.........:::::J5.
           .   ^G~:^^:::::::^:^^^^^:::::::::^:::::::::::::::^^::75^
               :P!^^^^^^^^:^^^^^^:^:::::^:::^:::::::::::::::^^7JY^
               .!5~^~^^^^^^^^^:^^^^^^^^:^^^^:^^^^^^^^^^^^^^~?55G?
                 ~J?~~~^^~~^~~~^^^^^^^:^^^~^^^^^^^^~~!!!?Y55GP?J!.
                  .~PYJ?77?7777!!!!!!!!!!!!7777??JJJJJ5PP5??J^  ..
                   .777?5J??YYYYY5?7777!!!!~!~~^^::.  .::
                        :!!~:.:^^:

        PENGUIN SO CUTE, I LOVE PENGUIN
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define NAME ""
#define int long long
#define ii pair<int,int>
const int oo=1e9;
const int mod=1e9+7;
const int N=1e5;
const int LG=18;
const int Sqrt=350;
//int hx[]={0,0,1,-1,1,1,-1,-1},hy[]={1,-1,0,0,1,-1,1,-1};
int n,dp[N+5][2][2][2][2],p[N+5],A,B;
vector<int>graph[N+5];
int find(int v)
{
    if(p[v]==0)return v;
    return p[v]=find(p[v]);
}
bool union_(int a,int b)
{
    a=find(a);
    b=find(b);
    if(a==b)return false;
    p[b]=a;
    return true;
}
int cal(int u,int x,int y,int z,int t,int pre)
{
    int &res=dp[u][x][y][z][t];
    if(res!=-1)return res;
    if(u==A&&x!=z)return res=oo;
    if(u==B&&x!=t)return res=oo;
    if(u==B&&y&&z)return res=oo;
    bool kt=false;
    if(y)kt=true;
    if(u==A&&t)kt=true;
    if(u==B&&z)kt=true;
    int sum=x;
    for(int v:graph[u])
        if(v!=pre)sum+=cal(v,0,x,z,t,u);
    res=oo;
    if(kt)res=sum;
    else
    {
        for(int v:graph[u])
            if(v!=pre)res=min(res,sum-cal(v,0,x,z,t,u)+cal(v,1,x,z,t,u));
    }
    return res;
}
main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    //freopen(""NAME".inp","r",stdin);
    //freopen(""NAME".out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;++i)
    {
        int u,v;cin>>u>>v;
        if(!union_(u,v))
        {
            A=u;B=v;
        }
        else
        {
            graph[u].push_back(v);
            graph[v].push_back(u);
        }
    }
    memset(dp,-1,sizeof(dp));
    int res=oo;
    res=min({cal(A,0,0,0,0,-1),cal(A,0,0,0,1,-1),cal(A,1,0,1,0,-1),cal(A,1,0,1,1,-1)});
    if(res<oo)cout<<res;
    else cout<<-1;

}
/*
         ଘ(੭ˊᵕˋ)੭* ੈ✩‧˚huynhyen1609<3
*/

Compilation message

Main.cpp:93:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   93 | main()
      | ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15196 KB Output is correct
2 Correct 6 ms 15188 KB Output is correct
3 Correct 6 ms 15188 KB Output is correct
4 Correct 7 ms 15188 KB Output is correct
5 Correct 135 ms 32716 KB Output is correct
6 Correct 140 ms 32644 KB Output is correct
7 Correct 192 ms 32760 KB Output is correct
8 Correct 163 ms 32852 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15188 KB Output is correct
2 Correct 6 ms 15188 KB Output is correct
3 Correct 7 ms 15188 KB Output is correct
4 Correct 6 ms 15188 KB Output is correct
5 Correct 7 ms 15080 KB Output is correct
6 Correct 6 ms 15092 KB Output is correct
7 Correct 6 ms 15188 KB Output is correct
8 Correct 6 ms 15096 KB Output is correct
9 Correct 6 ms 15188 KB Output is correct
10 Correct 5 ms 15188 KB Output is correct
11 Correct 6 ms 15188 KB Output is correct
12 Correct 6 ms 15188 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15188 KB Output is correct
2 Correct 6 ms 15188 KB Output is correct
3 Correct 7 ms 15188 KB Output is correct
4 Correct 6 ms 15188 KB Output is correct
5 Correct 7 ms 15080 KB Output is correct
6 Correct 6 ms 15092 KB Output is correct
7 Correct 6 ms 15188 KB Output is correct
8 Correct 6 ms 15096 KB Output is correct
9 Correct 6 ms 15188 KB Output is correct
10 Correct 5 ms 15188 KB Output is correct
11 Correct 6 ms 15188 KB Output is correct
12 Correct 6 ms 15188 KB Output is correct
13 Correct 6 ms 15228 KB Output is correct
14 Correct 7 ms 15252 KB Output is correct
15 Correct 7 ms 15444 KB Output is correct
16 Correct 7 ms 15252 KB Output is correct
17 Correct 7 ms 15188 KB Output is correct
18 Correct 7 ms 15188 KB Output is correct
19 Correct 7 ms 15188 KB Output is correct
20 Correct 7 ms 15188 KB Output is correct
21 Correct 7 ms 15188 KB Output is correct
22 Correct 7 ms 15228 KB Output is correct
23 Correct 7 ms 15316 KB Output is correct
24 Correct 7 ms 15188 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 15196 KB Output is correct
2 Correct 6 ms 15188 KB Output is correct
3 Correct 6 ms 15188 KB Output is correct
4 Correct 7 ms 15188 KB Output is correct
5 Correct 135 ms 32716 KB Output is correct
6 Correct 140 ms 32644 KB Output is correct
7 Correct 192 ms 32760 KB Output is correct
8 Correct 163 ms 32852 KB Output is correct
9 Correct 7 ms 15188 KB Output is correct
10 Correct 6 ms 15188 KB Output is correct
11 Correct 7 ms 15188 KB Output is correct
12 Correct 6 ms 15188 KB Output is correct
13 Correct 7 ms 15080 KB Output is correct
14 Correct 6 ms 15092 KB Output is correct
15 Correct 6 ms 15188 KB Output is correct
16 Correct 6 ms 15096 KB Output is correct
17 Correct 6 ms 15188 KB Output is correct
18 Correct 5 ms 15188 KB Output is correct
19 Correct 6 ms 15188 KB Output is correct
20 Correct 6 ms 15188 KB Output is correct
21 Correct 6 ms 15228 KB Output is correct
22 Correct 7 ms 15252 KB Output is correct
23 Correct 7 ms 15444 KB Output is correct
24 Correct 7 ms 15252 KB Output is correct
25 Correct 7 ms 15188 KB Output is correct
26 Correct 7 ms 15188 KB Output is correct
27 Correct 7 ms 15188 KB Output is correct
28 Correct 7 ms 15188 KB Output is correct
29 Correct 7 ms 15188 KB Output is correct
30 Correct 7 ms 15228 KB Output is correct
31 Correct 7 ms 15316 KB Output is correct
32 Correct 7 ms 15188 KB Output is correct
33 Correct 80 ms 20156 KB Output is correct
34 Correct 133 ms 20144 KB Output is correct
35 Correct 85 ms 20036 KB Output is correct
36 Correct 82 ms 20156 KB Output is correct
37 Correct 22 ms 16324 KB Output is correct
38 Correct 94 ms 20260 KB Output is correct
39 Correct 12 ms 15572 KB Output is correct
40 Correct 119 ms 20040 KB Output is correct
41 Correct 70 ms 21096 KB Output is correct
42 Correct 67 ms 20912 KB Output is correct
43 Correct 114 ms 32760 KB Output is correct
44 Correct 95 ms 26744 KB Output is correct