oj.uz

답안 #1033191

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1033191 2024-07-24T14:01:50 Z adaawf Super Dango Maker (JOI22_dango3) C++17
22 / 100
 1305 ms 1704 KB 
#include <bits/stdc++.h>
#include "dango3.h"
using namespace std;
vector<int> trya(vector<int> v, int x) {
    vector<int> vv;
    for (int w : v) {
        if (w != x) {
            vv.push_back(w);
        }
    }
    return vv;
}
/*void Print(vector<int> v) {
    for (int w : v) cout << w << " ";
    cout << '\n';
}
int Query(vector<int> v) {
    Print(v);
    int k;
    cin >> k;
    return k;
}
void Answer(vector<int> v) {
    Print(v);
}
void Solve(int n, int m);
int main() {
    int n = 4, m = 4;
    Solve(n, m);
}*/
int k = 5;
void check(vector<int> &vv, int &h) {
    vector<int> va = vv;
    for (int i = 0; i < k; i++) va = trya(va, va[h]);
    if (Query(va) != 0) {
        vv = va;
        return;
    }
    for (int i = h; i < h + k; i++) {
        if (Query(trya(vv, vv[i]))) {
            vv = trya(vv, vv[i]);
            h = i;
            return;
        }
    }
    h += k;
}
void Solve(int n, int m) {
    vector<int> v;
    vector<vector<int>> res;
    for (int i = 1; i <= n * m; i++) {
        v.push_back(i);
    }
    unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
    shuffle(v.begin(), v.end(), default_random_engine(seed));
    for (int i = 1; i <= m; i++) {
        vector<int> vv = v;
        int h = 0;
        while (vv.size() > n) {
            if (h < vv.size() - k + 1) {
                check(vv, h);
            }
            else if (Query(trya(vv, vv[h])) != 0) {
                vv = trya(vv, vv[h]);
            }
            else h++;
        }
        res.push_back(vv);
        for (int w : vv) v = trya(v, w);
    }
    for (auto w : res) Answer(w);
}

Compilation message

dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:59:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   59 |         while (vv.size() > n) {
      |                ~~~~~~~~~~^~~
dango3.cpp:60:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |             if (h < vv.size() - k + 1) {
      |                 ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 9 ms 348 KB Output is correct
3 Correct 8 ms 576 KB Output is correct
4 Correct 9 ms 348 KB Output is correct
5 Correct 11 ms 576 KB Output is correct
6 Correct 9 ms 348 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 307 ms 604 KB Output is correct
2 Correct 319 ms 684 KB Output is correct
3 Correct 326 ms 708 KB Output is correct
4 Correct 310 ms 600 KB Output is correct
5 Correct 305 ms 604 KB Output is correct
6 Correct 326 ms 600 KB Output is correct

Subtask #4
0 / 78.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1305 ms 1704 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -