oj.uz

Submission #231804

# Submission time Handle Problem Language Result Execution time Memory
231804 2020-05-14T21:48:04 Z duality Chameleon's Love (JOI20_chameleon) C++14
100 / 100
 59 ms 576 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 "chameleon.h"

vi adjList[1000];
int g[1000];
int ans[1000];
int getAdj(vi v,int u,int qq) {
    if (v.empty()) return 0;
    else if (adjList[u-1].size() == 3) return 0;
    if (qq) {
        v.pb(u);
        if (Query(v) == v.size()) return -1;
        v.pop_back();
    }
    if (v.size() == 1) {
        if (find(adjList[u-1].begin(),adjList[u-1].end(),v[0]-1) == adjList[u-1].end()) adjList[u-1].pb(v[0]-1);
        swap(u,v[0]);
        if (find(adjList[u-1].begin(),adjList[u-1].end(),v[0]-1) == adjList[u-1].end()) adjList[u-1].pb(v[0]-1);
        return 0;
    }
    int i;
    vi l,r;
    for (i = 0; i < v.size(); i++) {
        if (i < v.size()/2) l.pb(v[i]);
        else r.pb(v[i]);
    }
    getAdj(r,u,getAdj(l,u,1) != -1);
    return 0;
}
void Solve(int N) {
    int i,j,k;
    vector<vi> vv;
    for (i = 0; i < 2*N; i++) {
        random_shuffle(vv.begin(),vv.end());
        for (j = 0; j < vv.size(); j++) {
            vv[j].pb(i+1);
            if (Query(vv[j]) == vv[j].size()) break;
            else vv[j].pop_back();
        }
        if (j == vv.size()) vv.pb(vi(1,i+1));
    }
    for (i = 0; i < 2*N; i++) {
        for (j = 0; j < vv.size(); j++) {
            if (find(vv[j].begin(),vv[j].end(),i+1) == vv[j].end()) {
                vi v;
                for (k = 0; k < vv[j].size(); k++) {
                    if ((adjList[vv[j][k]-1].size() < 3) && (find(adjList[i].begin(),adjList[i].end(),vv[j][k]-1) == adjList[i].end()))
                        v.pb(vv[j][k]);
                }
                random_shuffle(v.begin(),v.end());
                getAdj(v,i+1,1);
            }
        }
    }
    for (i = 0; i < 2*N; i++) {
        sort(adjList[i].begin(),adjList[i].end());
        adjList[i].resize(unique(adjList[i].begin(),adjList[i].end())-adjList[i].begin());
        if (adjList[i].size() == 3) {
            vi v;
            v.pb(i+1),v.pb(adjList[i][0]+1),v.pb(adjList[i][1]+1);
            if (Query(v) == 1) adjList[i].pop_back();
            else {
                v[2] = adjList[i][2]+1;
                if (Query(v) == 1) swap(adjList[i][1],adjList[i][2]),adjList[i].pop_back();
                else swap(adjList[i][0],adjList[i][2]),adjList[i].pop_back();
            }
        }
    }
    for (i = 0; i < 2*N; i++) {
        for (j = 0; j < adjList[i].size(); j++) {
            int v = adjList[i][j];
            if (find(adjList[v].begin(),adjList[v].end(),i) != adjList[v].end()) ans[i] = v;
        }
    }
    for (i = 0; i < 2*N; i++) {
        if (ans[i] > i) Answer(i+1,ans[i]+1);
    }
}

Compilation message

chameleon.cpp: In function 'int getAdj(vi, int, int)':
chameleon.cpp:67:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (Query(v) == v.size()) return -1;
             ~~~~~~~~~^~~~~~~~~~~
chameleon.cpp:78:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < v.size(); i++) {
                 ~~^~~~~~~~~~
chameleon.cpp:79:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (i < v.size()/2) l.pb(v[i]);
             ~~^~~~~~~~~~~~
chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:90:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < vv.size(); j++) {
                     ~~^~~~~~~~~~~
chameleon.cpp:92:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (Query(vv[j]) == vv[j].size()) break;
                 ~~~~~~~~~~~~~^~~~~~~~~~~~~~~
chameleon.cpp:95:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (j == vv.size()) vv.pb(vi(1,i+1));
             ~~^~~~~~~~~~~~
chameleon.cpp:98:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < vv.size(); j++) {
                     ~~^~~~~~~~~~~
chameleon.cpp:101:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (k = 0; k < vv[j].size(); k++) {
                             ~~^~~~~~~~~~~~~~
chameleon.cpp:125:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < adjList[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 46 ms 384 KB Output is correct
4 Correct 46 ms 384 KB Output is correct
5 Correct 46 ms 456 KB Output is correct
6 Correct 46 ms 384 KB Output is correct
7 Correct 59 ms 384 KB Output is correct
8 Correct 47 ms 384 KB Output is correct
9 Correct 46 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 308 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 4 ms 384 KB Output is correct

Subtask #3
20.0 / 20.0

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

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 50 ms 576 KB Output is correct
4 Correct 47 ms 384 KB Output is correct
5 Correct 48 ms 576 KB Output is correct
6 Correct 48 ms 384 KB Output is correct
7 Correct 48 ms 384 KB Output is correct
8 Correct 49 ms 384 KB Output is correct
9 Correct 47 ms 384 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 46 ms 384 KB Output is correct
4 Correct 46 ms 384 KB Output is correct
5 Correct 46 ms 456 KB Output is correct
6 Correct 46 ms 384 KB Output is correct
7 Correct 59 ms 384 KB Output is correct
8 Correct 47 ms 384 KB Output is correct
9 Correct 46 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 308 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 4 ms 384 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 50 ms 576 KB Output is correct
31 Correct 47 ms 384 KB Output is correct
32 Correct 48 ms 576 KB Output is correct
33 Correct 48 ms 384 KB Output is correct
34 Correct 48 ms 384 KB Output is correct
35 Correct 49 ms 384 KB Output is correct
36 Correct 47 ms 384 KB Output is correct
37 Correct 49 ms 384 KB Output is correct
38 Correct 46 ms 384 KB Output is correct
39 Correct 49 ms 452 KB Output is correct
40 Correct 49 ms 444 KB Output is correct
41 Correct 48 ms 384 KB Output is correct
42 Correct 46 ms 384 KB Output is correct
43 Correct 47 ms 384 KB Output is correct
44 Correct 49 ms 384 KB Output is correct
45 Correct 48 ms 384 KB Output is correct