oj.uz

Submission #79439

# Submission time Handle Problem Language Result Execution time Memory
79439 2018-10-13T20:10:57 Z duality Mousetrap (CEOI17_mousetrap) C++11
100 / 100
 1107 ms 169404 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 ----------

int t,m;
vi adjList[1000000];
int parent[1000000],dp[1000000];
int doDFS(int u,int p) {
    int i;
    int m1 = 0,m2 = 0,c = 0;
    parent[u] = p;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if (v != p) {
            doDFS(v,u);
            if (dp[v] >= m1) m2 = m1,m1 = dp[v];
            else if (dp[v] >= m2) m2 = dp[v];
            c++;
        }
    }
    dp[u] = m2+c;
    return dp[u];
}
vi w[1000000];
int sum[1000000];
int main() {
    int i;
    int n;
    int a,b;
    scanf("%d %d %d",&n,&t,&m),t--,m--;
    for (i = 1; i < n; i++) {
        scanf("%d %d",&a,&b);
        a--,b--;
        adjList[a].pb(b);
        adjList[b].pb(a);
    }

    int j;
    int u = m,p = -1,c = 0;
    doDFS(t,-1);
    while (u != t) {
        for (i = 0; i < adjList[u].size(); i++) {
            int v = adjList[u][i];
            if ((v != parent[u]) && (v != p)) w[c].pb(dp[v]),sum[c]++;
        }
        sort(w[c].begin(),w[c].end(),greater<int>());
        p = u,u = parent[u],c++;
    }
    for (i = c-1; i >= 0; i--) sum[i] += sum[i+1];
    int l = 0,r = n;
    while (l < r) {
        int m = (l+r) / 2;
        int used = 0,can = 0;
        for (i = 0; i < c; i++) {
            can++,p = used;
            for (j = 0; j < w[i].size(); j++) {
                if (w[i][j]+sum[i]+p > m) {
                    used++,can--;
                    if (can < 0) break;
                }
            }
            if (j < w[i].size()) break;
        }
        if ((i == c) && (used <= m)) r = m;
        else l = m+1;
    }
    printf("%d\n",l);

    return 0;
}

Compilation message

mousetrap.cpp: In function 'int doDFS(int, int)':
mousetrap.cpp:65:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
mousetrap.cpp: In function 'int main()':
mousetrap.cpp:95:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[u].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~
mousetrap.cpp:109:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (j = 0; j < w[i].size(); j++) {
                         ~~^~~~~~~~~~~~~
mousetrap.cpp:115:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (j < w[i].size()) break;
                 ~~^~~~~~~~~~~~~
mousetrap.cpp:83:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d",&n,&t,&m),t--,m--;
     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
mousetrap.cpp:85:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&a,&b);
         ~~~~~^~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 47352 KB Output is correct
2 Correct 44 ms 47352 KB Output is correct
3 Correct 45 ms 47512 KB Output is correct
4 Correct 46 ms 47512 KB Output is correct
5 Correct 46 ms 47536 KB Output is correct
6 Correct 46 ms 47592 KB Output is correct
7 Correct 46 ms 47592 KB Output is correct
8 Correct 45 ms 47596 KB Output is correct
9 Correct 45 ms 47596 KB Output is correct
10 Correct 45 ms 47596 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 469 ms 86752 KB Output is correct
2 Correct 467 ms 86752 KB Output is correct
3 Correct 1103 ms 88140 KB Output is correct
4 Correct 521 ms 88140 KB Output is correct
5 Correct 1094 ms 88140 KB Output is correct
6 Correct 1039 ms 88232 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 47352 KB Output is correct
2 Correct 44 ms 47352 KB Output is correct
3 Correct 45 ms 47512 KB Output is correct
4 Correct 46 ms 47512 KB Output is correct
5 Correct 46 ms 47536 KB Output is correct
6 Correct 46 ms 47592 KB Output is correct
7 Correct 46 ms 47592 KB Output is correct
8 Correct 45 ms 47596 KB Output is correct
9 Correct 45 ms 47596 KB Output is correct
10 Correct 45 ms 47596 KB Output is correct
11 Correct 49 ms 88232 KB Output is correct
12 Correct 49 ms 88232 KB Output is correct
13 Correct 46 ms 88232 KB Output is correct
14 Correct 47 ms 88232 KB Output is correct
15 Correct 45 ms 88232 KB Output is correct
16 Correct 46 ms 88232 KB Output is correct
17 Correct 46 ms 88232 KB Output is correct
18 Correct 47 ms 88232 KB Output is correct
19 Correct 46 ms 88232 KB Output is correct
20 Correct 47 ms 88232 KB Output is correct
21 Correct 46 ms 88232 KB Output is correct
22 Correct 45 ms 88232 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 47352 KB Output is correct
2 Correct 44 ms 47352 KB Output is correct
3 Correct 45 ms 47512 KB Output is correct
4 Correct 46 ms 47512 KB Output is correct
5 Correct 46 ms 47536 KB Output is correct
6 Correct 46 ms 47592 KB Output is correct
7 Correct 46 ms 47592 KB Output is correct
8 Correct 45 ms 47596 KB Output is correct
9 Correct 45 ms 47596 KB Output is correct
10 Correct 45 ms 47596 KB Output is correct
11 Correct 469 ms 86752 KB Output is correct
12 Correct 467 ms 86752 KB Output is correct
13 Correct 1103 ms 88140 KB Output is correct
14 Correct 521 ms 88140 KB Output is correct
15 Correct 1094 ms 88140 KB Output is correct
16 Correct 1039 ms 88232 KB Output is correct
17 Correct 49 ms 88232 KB Output is correct
18 Correct 49 ms 88232 KB Output is correct
19 Correct 46 ms 88232 KB Output is correct
20 Correct 47 ms 88232 KB Output is correct
21 Correct 45 ms 88232 KB Output is correct
22 Correct 46 ms 88232 KB Output is correct
23 Correct 46 ms 88232 KB Output is correct
24 Correct 47 ms 88232 KB Output is correct
25 Correct 46 ms 88232 KB Output is correct
26 Correct 47 ms 88232 KB Output is correct
27 Correct 46 ms 88232 KB Output is correct
28 Correct 45 ms 88232 KB Output is correct
29 Correct 45 ms 88232 KB Output is correct
30 Correct 478 ms 88232 KB Output is correct
31 Correct 455 ms 88232 KB Output is correct
32 Correct 566 ms 169404 KB Output is correct
33 Correct 516 ms 169404 KB Output is correct
34 Correct 1070 ms 169404 KB Output is correct
35 Correct 1094 ms 169404 KB Output is correct
36 Correct 1094 ms 169404 KB Output is correct
37 Correct 1107 ms 169404 KB Output is correct
38 Correct 897 ms 169404 KB Output is correct
39 Correct 877 ms 169404 KB Output is correct
40 Correct 885 ms 169404 KB Output is correct