제출 #231800

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
231800		duality	카멜레온의 사랑 (JOI20_chameleon)	C++14	40 / 100	6 ms	640 KiB

chameleon

#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[500];
int ans[1000];
void Solve(int N) {
    int i,j;
    for (i = 0; i < 2*N; i++) {
        for (j = i+1; j < 2*N; j++) {
            vi v;
            v.pb(i+1),v.pb(j+1);
            if (Query(v) == 1) adjList[i].pb(j),adjList[j].pb(i);
        }
    }
    for (i = 0; i < 2*N; i++) {
        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);
    }
}

컴파일 시 표준 에러 (stderr) 메시지

chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:83:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < adjList[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 4
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 36