oj.uz

Submission #212183

# Submission time Handle Problem Language Result Execution time Memory
212183 2020-03-22T12:24:57 Z M0REDA Chameleon's Love (JOI20_chameleon) C++14
0 / 100
 587 ms 1400 KB 
#include <bits/stdc++.h>
#include "chameleon.h"
#define debug(x) cerr << #x << " = " << x << ", ";
#define ll long long
#define pb push_back
using namespace std;
#define FAST_IO                       \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);
void Solve(int N)
{
    vector<vector<int>> v(2 * N + 1);
    vector<int> graph(2 * N + 1, -1);
    for (int i = 1; i <= 2 * N; i++)
    {
        for (int j = i + 1; j <= 2 * N && v[i].size() != 1; j++)
        {
            vector<int> p;
            p.pb(i);
            p.pb(j);
            int z = Query(p);
            debug(i);
            debug(j);
            debug(z);
            cerr << endl;
            cerr << "======================" << endl;
            if (z == 1)
            {
                v[i].pb(j);
                v[j].pb(i);
                break;
            }
        }
    }
    for (auto a : v)
    {
        for (auto b : a)
        {
            cerr << b << " ";
        }
        cerr << endl;
    }
    // for (int i = 1; i <= 2 * N; i++)
    // {
    //     if (v[i].size() == 1)
    //     {
    //         continue;
    //     }
    //     for (int j = 0; j < 3 && graph[i] == -1; j++)
    //     {
    //         for (int k = j + 1; k < 3; k++)
    //         {
    //             vector<int> p;
    //             p.pb(i);
    //             p.pb(v[i][j]);
    //             p.pb(v[i][k]);
    //             if (Query(p) == 1)
    //             {
    //                 graph[i] = v[i][3 - j - k];
    //                 break;
    //             }
    //         }
    //     }
    // }
    for (int i = 1; i <= 2 * N; i++)
    {
        debug(i);
        cerr << endl;
        cerr << " tttttttttt " << endl;
        if (v[i].size() == 1)
        {
            debug(i);

            debug(v[i][0]);
            cerr << endl;
            cerr << "===================" << endl;
            if (i < v[i][0])
                Answer(i, v[i][0]);
            continue;
        }
        if (v[i].size() == 2)
        {
            assert(false);
        }
        for (int j = 0; j < 3; j++)
        {
            debug(i);
            debug(v[i][j]);
            cerr << endl;
            if (v[i][j] == graph[i] || i == graph[v[i][j]])
            {
                continue;
            }
            cerr << "passed" << endl;
            cerr << "===================" << endl;

            if (i < v[i][j])
                Answer(i, v[i][j]);
            break;
        }
    }
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Incorrect 587 ms 1400 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Incorrect 587 ms 1400 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -