oj.uz

Submission #122242

# Submission time Handle Problem Language Result Execution time Memory
122242 2019-06-27T23:36:04 Z duality Mergers (JOI19_mergers) C++11
0 / 100
 110 ms 33320 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

vi adjList[500000];
vi states[500000];
int parent[500000],depth[500000];
int doDFS(int u,int p,int d) {
    int i;
    parent[u] = p,depth[u] = d;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if (v != p) doDFS(v,u,d+1);
    }
    return 0;
}
int ds[500000];
int find(int n) {
    if (ds[n] != n) ds[n] = find(ds[n]);
    return ds[n];
}
int main() {
    int i;
    int N,K;
    int A,B,S;
    scanf("%d %d",&N,&K);
    for (i = 0; i < N-1; i++) {
        scanf("%d %d",&A,&B);
        A--,B--;
        adjList[A].pb(B);
        adjList[B].pb(A);
    }
    for (i = 0; i < N; i++) scanf("%d",&S),states[S-1].pb(i);

    int j;
    doDFS(0,-1,0);
    for (i = 0; i < N; i++) ds[i] = i;
    for (i = 0; i < K; i++) {
        for (j = 1; j < states[i].size(); j++) {
            int u = find(states[i][j-1]),v = find(states[i][j]);
            while (u != v) {
                if (depth[u] < depth[v]) swap(u,v);
                ds[u] = find(parent[u]),u = find(u);
            }
        }
    }
    int ans = 0;
    for (i = 0; i < N; i++) {
        if (ds[i] == i) {
            int deg = 0;
            for (j = 0; j < adjList[i].size(); j++) {
                int v = adjList[i][j];
                if (i != find(v)) deg++;
            }
            if (deg == 1) ans++;
        }
    }
    printf("%d\n",(ans+1)/2);

    return 0;
}

Compilation message

mergers.cpp: In function 'int doDFS(int, int, int)':
mergers.cpp:64:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
mergers.cpp: In function 'int main()':
mergers.cpp:92:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 1; j < states[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~~~
mergers.cpp:104:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (j = 0; j < adjList[i].size(); j++) {
                         ~~^~~~~~~~~~~~~~~~~~~
mergers.cpp:79:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&N,&K);
     ~~~~~^~~~~~~~~~~~~~~
mergers.cpp:81:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&A,&B);
         ~~~~~^~~~~~~~~~~~~~~
mergers.cpp:86:43: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < N; i++) scanf("%d",&S),states[S-1].pb(i);
                             ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23808 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 23 ms 23808 KB Output is correct
4 Correct 25 ms 23800 KB Output is correct
5 Correct 22 ms 23808 KB Output is correct
6 Correct 23 ms 23808 KB Output is correct
7 Correct 49 ms 23860 KB Output is correct
8 Correct 22 ms 23800 KB Output is correct
9 Correct 24 ms 23808 KB Output is correct
10 Correct 23 ms 23808 KB Output is correct
11 Correct 23 ms 23808 KB Output is correct
12 Incorrect 23 ms 23808 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23808 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 23 ms 23808 KB Output is correct
4 Correct 25 ms 23800 KB Output is correct
5 Correct 22 ms 23808 KB Output is correct
6 Correct 23 ms 23808 KB Output is correct
7 Correct 49 ms 23860 KB Output is correct
8 Correct 22 ms 23800 KB Output is correct
9 Correct 24 ms 23808 KB Output is correct
10 Correct 23 ms 23808 KB Output is correct
11 Correct 23 ms 23808 KB Output is correct
12 Incorrect 23 ms 23808 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23808 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 23 ms 23808 KB Output is correct
4 Correct 25 ms 23800 KB Output is correct
5 Correct 22 ms 23808 KB Output is correct
6 Correct 23 ms 23808 KB Output is correct
7 Correct 49 ms 23860 KB Output is correct
8 Correct 22 ms 23800 KB Output is correct
9 Correct 24 ms 23808 KB Output is correct
10 Correct 23 ms 23808 KB Output is correct
11 Correct 23 ms 23808 KB Output is correct
12 Incorrect 23 ms 23808 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 30496 KB Output is correct
2 Correct 110 ms 33320 KB Output is correct
3 Incorrect 24 ms 24064 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23808 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 23 ms 23808 KB Output is correct
4 Correct 25 ms 23800 KB Output is correct
5 Correct 22 ms 23808 KB Output is correct
6 Correct 23 ms 23808 KB Output is correct
7 Correct 49 ms 23860 KB Output is correct
8 Correct 22 ms 23800 KB Output is correct
9 Correct 24 ms 23808 KB Output is correct
10 Correct 23 ms 23808 KB Output is correct
11 Correct 23 ms 23808 KB Output is correct
12 Incorrect 23 ms 23808 KB Output isn't correct
13 Halted 0 ms 0 KB -