oj.uz

Submission #131278

# Submission time Handle Problem Language Result Execution time Memory
131278 2019-07-16T23:34:17 Z duality Cats or Dogs (JOI18_catdog) C++11
38 / 100
 3000 ms 12000 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 ----------
#include "catdog.h"

int n;
vi adjList[100000];
int parent[100000],dp[100000][2];
int curr[100000];
int doDFS(int u,int p) {
    int i;
    parent[u] = p;
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i];
        if (v != p) doDFS(v,u);
    }
    return 0;
}
void initialize(int N,vector<int> A,vector<int> B) {
    int i;
    n = N;
    for (i = 0; i < N-1; i++) {
        A[i]--,B[i]--;
        adjList[A[i]].pb(B[i]);
        adjList[B[i]].pb(A[i]);
    }
    doDFS(0,-1);
}
int update(int u) {
    int i;
    while (u != -1) {
        dp[u][0] = dp[u][1] = 0;
        for (i = 0; i < adjList[u].size(); i++) {
            int v = adjList[u][i];
            if (v != parent[u]) {
                dp[u][0] += min(dp[v][0],dp[v][1]+1);
                dp[u][1] += min(dp[v][1],dp[v][0]+1);
            }
        }
        if (curr[u] == 1) dp[u][1] = 1e9;
        else if (curr[u] == 2) dp[u][0] = 1e9;
        u = parent[u];
    }
    return 0;
}
int cat(int v) {
    v--,curr[v] = 1,update(v);
    return min(dp[0][0],dp[0][1]);
}
int dog(int v) {
    v--,curr[v] = 2,update(v);
    return min(dp[0][0],dp[0][1]);
}
int neighbor(int v) {
    v--,curr[v] = 0,update(v);
    return min(dp[0][0],dp[0][1]);
}

Compilation message

catdog.cpp: In function 'int doDFS(int, int)':
catdog.cpp:66:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
catdog.cpp: In function 'int update(int)':
catdog.cpp:86:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[u].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2708 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 4 ms 2680 KB Output is correct
16 Correct 4 ms 2680 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2708 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 4 ms 2680 KB Output is correct
16 Correct 4 ms 2680 KB Output is correct
17 Correct 5 ms 2808 KB Output is correct
18 Correct 5 ms 2808 KB Output is correct
19 Correct 5 ms 2808 KB Output is correct
20 Correct 4 ms 2680 KB Output is correct
21 Correct 4 ms 2680 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 5 ms 2812 KB Output is correct
24 Correct 6 ms 2808 KB Output is correct
25 Correct 5 ms 2680 KB Output is correct
26 Correct 4 ms 2684 KB Output is correct
27 Correct 5 ms 2680 KB Output is correct
28 Correct 5 ms 2808 KB Output is correct
29 Correct 7 ms 2808 KB Output is correct
30 Correct 5 ms 2680 KB Output is correct
31 Correct 5 ms 2808 KB Output is correct
32 Correct 5 ms 2680 KB Output is correct

Subtask #3
0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2708 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 4 ms 2680 KB Output is correct
15 Correct 4 ms 2680 KB Output is correct
16 Correct 4 ms 2680 KB Output is correct
17 Correct 5 ms 2808 KB Output is correct
18 Correct 5 ms 2808 KB Output is correct
19 Correct 5 ms 2808 KB Output is correct
20 Correct 4 ms 2680 KB Output is correct
21 Correct 4 ms 2680 KB Output is correct
22 Correct 4 ms 2680 KB Output is correct
23 Correct 5 ms 2812 KB Output is correct
24 Correct 6 ms 2808 KB Output is correct
25 Correct 5 ms 2680 KB Output is correct
26 Correct 4 ms 2684 KB Output is correct
27 Correct 5 ms 2680 KB Output is correct
28 Correct 5 ms 2808 KB Output is correct
29 Correct 7 ms 2808 KB Output is correct
30 Correct 5 ms 2680 KB Output is correct
31 Correct 5 ms 2808 KB Output is correct
32 Correct 5 ms 2680 KB Output is correct
33 Correct 271 ms 7792 KB Output is correct
34 Correct 109 ms 7416 KB Output is correct
35 Correct 364 ms 6940 KB Output is correct
36 Correct 480 ms 11200 KB Output is correct
37 Correct 21 ms 4984 KB Output is correct
38 Correct 522 ms 11860 KB Output is correct
39 Correct 535 ms 11880 KB Output is correct
40 Correct 664 ms 11868 KB Output is correct
41 Correct 595 ms 11976 KB Output is correct
42 Correct 747 ms 11968 KB Output is correct
43 Correct 604 ms 11876 KB Output is correct
44 Correct 703 ms 11880 KB Output is correct
45 Correct 923 ms 11880 KB Output is correct
46 Correct 605 ms 11876 KB Output is correct
47 Correct 511 ms 12000 KB Output is correct
48 Execution timed out 3046 ms 9060 KB Time limit exceeded
49 Halted 0 ms 0 KB -