oj.uz

Submission #232683

# Submission time Handle Problem Language Result Execution time Memory
232683 2020-05-17T20:18:50 Z duality Stray Cat (JOI20_stray) C++14
91 / 100
 67 ms 16892 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 "Anthony.h"

vpii adjList[20000];
int dist[20000];
queue<int> Q;
vi m;
string s = "010011";
int doDFS(int u,int p,int pp,int c) {
    int i;
    int x = 0;
    if (p != -1) m[pp] = s[c]-'0';
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i].first;
        if (v != p) x++;
    }
    if (x == 1) {
        for (i = 0; i < adjList[u].size(); i++) {
            int v = adjList[u][i].first;
            if (v != p) doDFS(v,u,adjList[u][i].second,(c+1) % 6);
        }
    }
    else {
        for (i = 0; i < adjList[u].size(); i++) {
            int v = adjList[u][i].first;
            if (v != p) doDFS(v,u,adjList[u][i].second,(s[c]-'0')^1);
        }
    }
    return 0;
}
vector<int> Mark(int N,int M,int A,int B,vector<int> U,vector<int> V) {
    int i;
    for (i = 0; i < M; i++) {
        adjList[U[i]].pb(mp(V[i],i));
        adjList[V[i]].pb(mp(U[i],i));
    }
    if (A >= 3) {
        for (i = 0; i < N; i++) dist[i] = -1;
        Q.push(0),dist[0] = 0;
        while (!Q.empty()) {
            int u = Q.front();
            Q.pop();

            for (i = 0; i < adjList[u].size(); i++) {
                int v = adjList[u][i].first;
                if (dist[v] == -1) {
                    dist[v] = dist[u]+1;
                    Q.push(v);
                }
            }
        }
        for (i = 0; i < M; i++) {
            if (dist[U[i]] == dist[V[i]]) m.pb(dist[U[i]] % 3);
            else m.pb(min(dist[U[i]],dist[V[i]]) % 3);
        }
    }
    else {
        m.resize(M);
        doDFS(0,-1,-1,0);
    }

    return m;
}

#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 "Catherine.h"

int a,b;
void Init(int A,int B) {
    a = A,b = B;
}
vi v;
int f = 1;
int Move(vector<int> y) {
    if (a >= 3) {
        if ((y[1] == 0) && (y[2] == 0)) return 0;
        else if ((y[0] == 0) && (y[2] == 0)) return 1;
        else if ((y[0] == 0) && (y[1] == 0)) return 2;
        else if (y[0] == 0) return 1;
        else if (y[1] == 0) return 2;
        else return 0;
    }
    else {
        if (v.empty()) {
            if (y[0]+y[1] == 2) {
                if (y[0] > 0) y[0]--,v.pb(0);
                else y[1]--,v.pb(1);
                if (y[0] > 0) v.pb(0);
                else v.pb(1);
                return v[1];
            }
            else {
                f = 0;
                if (y[0] == 1) v.pb(0);
                else v.pb(1);
                return v[0];
            }
        }
        else {
            if (f) {
                if (y[0]+y[1] == 1) {
                    if (y[0] == 1) v.pb(0);
                    else v.pb(1);
                    if (v.size() == 5) {
                        string s;
                        int i;
                        for (i = 0; i < v.size(); i++) s += '0'+v[i];
                        if ((s == "11010") || (s == "10100") || (s == "01001") \
                            || (s == "10011") || (s == "00110") || (s == "01101")) {

                            f = 0;
                            v = vi(1,v[3]);
                            return -1;
                        }
                        else {
                            f = 0;
                            return v.back();
                        }
                    }
                    else return v.back();
                }
                else {
                    if ((y[0] == 0) || (y[1] == 0)) {
                        f = 0;
                        v = vi(1,v.back());
                        return -1;
                    }
                    else {
                        f = 1;
                        v.pb(v.back()^1);
                        return v.back();
                    }
                }
            }
            else {
                if (y[0]+y[1] == 1) {
                    if (y[0] == 1) v.pb(0);
                    else v.pb(1);
                    return v.back();
                }
                else {
                    v.pb(v.back()^1);
                    return v.back();
                }
            }
        }
    }
}

Compilation message

Anthony.cpp: In function 'int doDFS(int, int, int, int)':
Anthony.cpp:68:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
Anthony.cpp:73:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[u].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~
Anthony.cpp:79:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[u].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~
Anthony.cpp: In function 'std::vector<int> Mark(int, int, int, int, std::vector<int>, std::vector<int>)':
Anthony.cpp:99:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (i = 0; i < adjList[u].size(); i++) {
                         ~~^~~~~~~~~~~~~~~~~~~

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:98:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                         for (i = 0; i < v.size(); i++) s += '0'+v[i];
                                     ~~^~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 15756 KB Output is correct
2 Correct 9 ms 1536 KB Output is correct
3 Correct 45 ms 15052 KB Output is correct
4 Correct 66 ms 16860 KB Output is correct
5 Correct 65 ms 16892 KB Output is correct
6 Correct 53 ms 15728 KB Output is correct
7 Correct 53 ms 15488 KB Output is correct
8 Correct 63 ms 16296 KB Output is correct
9 Correct 61 ms 16260 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 15756 KB Output is correct
2 Correct 9 ms 1536 KB Output is correct
3 Correct 45 ms 15052 KB Output is correct
4 Correct 66 ms 16860 KB Output is correct
5 Correct 65 ms 16892 KB Output is correct
6 Correct 53 ms 15728 KB Output is correct
7 Correct 53 ms 15488 KB Output is correct
8 Correct 63 ms 16296 KB Output is correct
9 Correct 61 ms 16260 KB Output is correct
10 Correct 49 ms 13740 KB Output is correct
11 Correct 50 ms 13740 KB Output is correct
12 Correct 50 ms 13716 KB Output is correct
13 Correct 49 ms 13732 KB Output is correct
14 Correct 52 ms 13960 KB Output is correct
15 Correct 55 ms 14376 KB Output is correct
16 Correct 60 ms 16620 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 13432 KB Output is correct
2 Correct 9 ms 1536 KB Output is correct
3 Correct 43 ms 12896 KB Output is correct
4 Correct 61 ms 14820 KB Output is correct
5 Correct 67 ms 14832 KB Output is correct
6 Correct 59 ms 13688 KB Output is correct
7 Correct 63 ms 13504 KB Output is correct
8 Correct 60 ms 13952 KB Output is correct
9 Correct 59 ms 14088 KB Output is correct
10 Correct 54 ms 13832 KB Output is correct
11 Correct 55 ms 13824 KB Output is correct
12 Correct 54 ms 13856 KB Output is correct
13 Correct 54 ms 13852 KB Output is correct
14 Correct 62 ms 14108 KB Output is correct
15 Correct 57 ms 14112 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 13432 KB Output is correct
2 Correct 9 ms 1536 KB Output is correct
3 Correct 43 ms 12896 KB Output is correct
4 Correct 61 ms 14820 KB Output is correct
5 Correct 67 ms 14832 KB Output is correct
6 Correct 59 ms 13688 KB Output is correct
7 Correct 63 ms 13504 KB Output is correct
8 Correct 60 ms 13952 KB Output is correct
9 Correct 59 ms 14088 KB Output is correct
10 Correct 54 ms 13832 KB Output is correct
11 Correct 55 ms 13824 KB Output is correct
12 Correct 54 ms 13856 KB Output is correct
13 Correct 54 ms 13852 KB Output is correct
14 Correct 62 ms 14108 KB Output is correct
15 Correct 57 ms 14112 KB Output is correct
16 Correct 47 ms 11780 KB Output is correct
17 Correct 46 ms 11792 KB Output is correct
18 Correct 48 ms 11820 KB Output is correct
19 Correct 48 ms 11804 KB Output is correct
20 Correct 54 ms 12436 KB Output is correct
21 Correct 50 ms 12216 KB Output is correct
22 Correct 56 ms 14352 KB Output is correct
23 Correct 49 ms 11916 KB Output is correct
24 Correct 49 ms 11968 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1792 KB Output is correct
2 Correct 9 ms 1536 KB Output is correct
3 Correct 10 ms 1792 KB Output is correct
4 Correct 10 ms 1792 KB Output is correct
5 Correct 10 ms 1792 KB Output is correct
6 Correct 10 ms 1792 KB Output is correct
7 Correct 10 ms 1792 KB Output is correct
8 Correct 10 ms 1792 KB Output is correct
9 Correct 10 ms 1792 KB Output is correct
10 Correct 11 ms 1792 KB Output is correct
11 Correct 10 ms 1600 KB Output is correct
12 Correct 10 ms 1536 KB Output is correct
13 Correct 10 ms 1792 KB Output is correct
14 Correct 10 ms 1792 KB Output is correct
15 Correct 10 ms 1792 KB Output is correct
16 Correct 10 ms 1556 KB Output is correct
17 Correct 10 ms 1552 KB Output is correct
18 Correct 10 ms 1536 KB Output is correct
19 Correct 10 ms 1680 KB Output is correct
20 Correct 10 ms 1536 KB Output is correct
21 Correct 10 ms 1536 KB Output is correct
22 Correct 10 ms 1792 KB Output is correct
23 Correct 10 ms 1536 KB Output is correct
24 Correct 10 ms 1536 KB Output is correct
25 Correct 10 ms 1536 KB Output is correct
26 Correct 10 ms 1792 KB Output is correct
27 Correct 10 ms 1536 KB Output is correct
28 Correct 10 ms 1536 KB Output is correct

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 11508 KB Output is correct
2 Correct 54 ms 12964 KB Output is correct
3 Correct 9 ms 1536 KB Output is correct
4 Correct 42 ms 11816 KB Output is correct
5 Correct 59 ms 14128 KB Output is correct
6 Correct 60 ms 14120 KB Output is correct
7 Correct 50 ms 13248 KB Output is correct
8 Correct 51 ms 13256 KB Output is correct
9 Correct 57 ms 14044 KB Output is correct
10 Correct 59 ms 14152 KB Output is correct
11 Correct 57 ms 14128 KB Output is correct
12 Correct 60 ms 13912 KB Output is correct
13 Correct 61 ms 14148 KB Output is correct
14 Correct 61 ms 14140 KB Output is correct
15 Correct 59 ms 14140 KB Output is correct
16 Correct 59 ms 14156 KB Output is correct
17 Correct 56 ms 13900 KB Output is correct
18 Correct 59 ms 13744 KB Output is correct
19 Correct 56 ms 13768 KB Output is correct
20 Correct 55 ms 13760 KB Output is correct
21 Correct 55 ms 13888 KB Output is correct
22 Correct 56 ms 13884 KB Output is correct
23 Correct 47 ms 11876 KB Output is correct
24 Correct 50 ms 11872 KB Output is correct
25 Correct 50 ms 12332 KB Output is correct
26 Correct 51 ms 12468 KB Output is correct
27 Correct 54 ms 13012 KB Output is correct
28 Correct 54 ms 13100 KB Output is correct
29 Correct 55 ms 13100 KB Output is correct
30 Correct 55 ms 13108 KB Output is correct
31 Correct 48 ms 11848 KB Output is correct
32 Correct 48 ms 11888 KB Output is correct
33 Correct 48 ms 12360 KB Output is correct
34 Correct 49 ms 12324 KB Output is correct
35 Correct 56 ms 13008 KB Output is correct
36 Correct 53 ms 12772 KB Output is correct
37 Correct 57 ms 12780 KB Output is correct
38 Correct 54 ms 12756 KB Output is correct
39 Correct 55 ms 12772 KB Output is correct
40 Correct 54 ms 13016 KB Output is correct
41 Correct 55 ms 13324 KB Output is correct
42 Correct 56 ms 13468 KB Output is correct
43 Correct 56 ms 13484 KB Output is correct
44 Correct 55 ms 13464 KB Output is correct
45 Correct 60 ms 13472 KB Output is correct
46 Correct 56 ms 13388 KB Output is correct
47 Correct 55 ms 12628 KB Output is correct
48 Correct 52 ms 12700 KB Output is correct
49 Correct 52 ms 12696 KB Output is correct
50 Correct 54 ms 12756 KB Output is correct
51 Correct 48 ms 12204 KB Output is correct
52 Correct 50 ms 12212 KB Output is correct
53 Correct 51 ms 12076 KB Output is correct
54 Correct 49 ms 12208 KB Output is correct
55 Correct 48 ms 12208 KB Output is correct
56 Correct 48 ms 12208 KB Output is correct
57 Correct 50 ms 12340 KB Output is correct
58 Correct 50 ms 12200 KB Output is correct
59 Correct 50 ms 12008 KB Output is correct
60 Correct 50 ms 12000 KB Output is correct

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 11628 KB Output is correct
2 Incorrect 45 ms 12612 KB Wrong Answer [5]
3 Halted 0 ms 0 KB -