oj.uz

Submission #232677

# Submission time Handle Problem Language Result Execution time Memory
232677 2020-05-17T19:47:35 Z duality Stray Cat (JOI20_stray) C++14
15 / 100
 64 ms 17004 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 c) {
    int i;
    int x = 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) m[adjList[u][i].second] = (s[c]-'0'),doDFS(v,u,(c+1) % 6);
        }
    }
    else {
        for (i = 0; i < adjList[u].size(); i++) {
            int v = adjList[u][i].first;
            if (v != p) m[adjList[u][i].second] = (s[c]-'0'),doDFS(v,u,(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,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 {
                    f = 0;
                    v = vi(1,v.back());
                    return -1;
                }
            }
            else {
                if (y[0]+y[1] == 1) {
                    if (y[0] == 1) v.pb(0);
                    else v.pb(1);
                    return v.back();
                }
                else return v.back()^1;
            }
        }
    }
}

Compilation message

Anthony.cpp: In function 'int doDFS(int, int, int)':
Anthony.cpp:67:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
Anthony.cpp:72:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[u].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~
Anthony.cpp:78: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:98: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 59 ms 15748 KB Output is correct
2 Correct 9 ms 1536 KB Output is correct
3 Correct 46 ms 15136 KB Output is correct
4 Correct 64 ms 16992 KB Output is correct
5 Correct 64 ms 17004 KB Output is correct
6 Correct 54 ms 15512 KB Output is correct
7 Correct 55 ms 15832 KB Output is correct
8 Correct 61 ms 16304 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 59 ms 15748 KB Output is correct
2 Correct 9 ms 1536 KB Output is correct
3 Correct 46 ms 15136 KB Output is correct
4 Correct 64 ms 16992 KB Output is correct
5 Correct 64 ms 17004 KB Output is correct
6 Correct 54 ms 15512 KB Output is correct
7 Correct 55 ms 15832 KB Output is correct
8 Correct 61 ms 16304 KB Output is correct
9 Correct 61 ms 16260 KB Output is correct
10 Correct 54 ms 13824 KB Output is correct
11 Correct 57 ms 13712 KB Output is correct
12 Correct 50 ms 13712 KB Output is correct
13 Correct 51 ms 13744 KB Output is correct
14 Correct 52 ms 14000 KB Output is correct
15 Correct 59 ms 14328 KB Output is correct
16 Correct 57 ms 16628 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 13548 KB Output is correct
2 Correct 9 ms 1536 KB Output is correct
3 Correct 53 ms 12972 KB Output is correct
4 Correct 62 ms 14792 KB Output is correct
5 Correct 63 ms 14956 KB Output is correct
6 Correct 51 ms 13308 KB Output is correct
7 Correct 53 ms 13728 KB Output is correct
8 Correct 62 ms 14112 KB Output is correct
9 Correct 62 ms 14068 KB Output is correct
10 Correct 56 ms 13692 KB Output is correct
11 Correct 60 ms 13856 KB Output is correct
12 Correct 57 ms 13856 KB Output is correct
13 Correct 56 ms 13692 KB Output is correct
14 Correct 57 ms 14096 KB Output is correct
15 Correct 59 ms 14104 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 13548 KB Output is correct
2 Correct 9 ms 1536 KB Output is correct
3 Correct 53 ms 12972 KB Output is correct
4 Correct 62 ms 14792 KB Output is correct
5 Correct 63 ms 14956 KB Output is correct
6 Correct 51 ms 13308 KB Output is correct
7 Correct 53 ms 13728 KB Output is correct
8 Correct 62 ms 14112 KB Output is correct
9 Correct 62 ms 14068 KB Output is correct
10 Correct 56 ms 13692 KB Output is correct
11 Correct 60 ms 13856 KB Output is correct
12 Correct 57 ms 13856 KB Output is correct
13 Correct 56 ms 13692 KB Output is correct
14 Correct 57 ms 14096 KB Output is correct
15 Correct 59 ms 14104 KB Output is correct
16 Correct 52 ms 11784 KB Output is correct
17 Correct 47 ms 11776 KB Output is correct
18 Correct 49 ms 11820 KB Output is correct
19 Correct 49 ms 11824 KB Output is correct
20 Correct 55 ms 12460 KB Output is correct
21 Correct 50 ms 12208 KB Output is correct
22 Correct 60 ms 14204 KB Output is correct
23 Correct 49 ms 11896 KB Output is correct
24 Correct 49 ms 12084 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 1564 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 47 ms 11580 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 46 ms 11388 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -