oj.uz

Submission #1052760

# Submission time Handle Problem Language Result Execution time Memory
1052760 2024-08-10T20:26:20 Z j_vdd16 Super Dango Maker (JOI22_dango3) C++17
22 / 100
 1689 ms 772 KB 
#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

#include "dango3.h"

void Solve(int n, int m) {
    int colorCount = 1;
    vi color(n * m);
    color[0] = 0;
    vvi byColor(n);
    byColor[0].push_back(0);

    for (int i = 1; i < n * m; i++) {
        vi y;
        for (int j = i + 1; j < n * m; j++)
            y.push_back(j + 1);

        loop(j, colorCount) {
            for (int k = 1; k < byColor[j].size(); k++) {
                y.push_back(byColor[j][k] + 1);
            }
        }

        int res = Query(y);
        if (res == m - 1) {
            color[i] = colorCount;
            byColor[colorCount].push_back(i);
            colorCount++;
        }
        else {
            int l = 0, r = colorCount - 1;
            while (l < r) {
                int middle = (l + r) / 2;

                vi x;
                for (int j = i + 1; j < n * m; j++)
                    x.push_back(j + 1);

                loop(j, colorCount) {
                    int k = 0;
                    if (l <= j && j <= middle) k++;

                    for (; k < byColor[j].size(); k++) {
                        x.push_back(byColor[j][k] + 1);
                    }
                }

                res = Query(x);
                if (res == m - 1) {
                    l = middle + 1;
                }
                else {
                    r = middle;
                }
            }

            color[i] = l;
            byColor[l].push_back(i);
        }
    }

    loop(i, m) {
        vi x;
        loop(j, n) {
            x.push_back(byColor[j][i] + 1);
        }

        Answer(x);
    }
}

Compilation message

dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:45:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |             for (int k = 1; k < byColor[j].size(); k++) {
      |                             ~~^~~~~~~~~~~~~~~~~~~
dango3.cpp:69:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |                     for (; k < byColor[j].size(); k++) {
      |                            ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 520 KB Output is correct
2 Correct 18 ms 348 KB Output is correct
3 Correct 14 ms 512 KB Output is correct
4 Correct 16 ms 516 KB Output is correct
5 Correct 18 ms 516 KB Output is correct
6 Correct 18 ms 348 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 639 ms 624 KB Output is correct
2 Correct 626 ms 656 KB Output is correct
3 Correct 565 ms 604 KB Output is correct
4 Correct 565 ms 648 KB Output is correct
5 Correct 634 ms 640 KB Output is correct
6 Correct 650 ms 624 KB Output is correct

Subtask #4
0 / 78.0

# Verdict Execution time Memory Grader output
1 Incorrect 1689 ms 772 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -