oj.uz

Submission #1089590

# Submission time Handle Problem Language Result Execution time Memory
1089590 2024-09-16T18:40:13 Z _8_8_ Super Dango Maker (JOI22_dango3) C++17
22 / 100
 646 ms 856 KB 
#include "dango3.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;

int n, m;
const int N = 401;
bool bad[N * 26];
int B = -1;
vector<int> get(vector<int> &a, vector<int> &b) {
    for(int j:a) {
        bad[j] = 0;
    }
    int lst = 0;
    vector<int> ret;
    int new_B = -1;
    // for(int j:a) {
    //     cout << j << ' ';
    // }
    // cout << B << '\n';
    for(int i = 0; i < m; i++) {
        int l = lst - 1, r = (int)a.size() - 1;
        if(B != -1 && i == 0) {
            r = B;
        }
        int left = m - i;
        if(left == (int)a.size() - lst) {
            for(int j = lst; j < (int)a.size(); j++) {
                ret.push_back(a[j]);
            }
            break;
        }
        while(r - l > 1) {
            int mid = (l + r) >> 1;
            vector<int> t = b;
            for(int j = 0; j <= mid; j++) {
                if(!bad[a[j]])t.push_back(a[j]);
            }
            if(Query(t)) {
                r = mid;
            } else {
                l = mid; 
            }
        }
        lst = r + 1;
        ret.push_back(a[r]);
        bad[a[r]] = 1;
        if(i == 0 && B == -1) {
            new_B = r - 1;
        }
    }
    B = new_B;
    return ret;
}
vector<int> res[N];
int timer = 0, vis[N * 26];
void Solve(int _n, int _m) {
    n = _n, m = _m;
    vector<int> f, bf;
    for(int i = 1; i <= n * m; i++) {
        f.push_back(i);
    }
    for(int i = 0; i < n; i++) {
        timer++;
        vector<int> nv = get(f, bf);
        bf.push_back(nv[0]);
        for(int j = 0; j < m; j++) {
            // cout << nv[j] << ' ';
            res[j].push_back(nv[j]);
            vis[nv[j]] = timer;
        }
        // cout << '\n';
        vector<int> sw;
        for(int j:f) {
            if(vis[j] != timer) {
                sw.push_back(j);
            }
        }
        f = sw;
    }
    for(int i = 0; i < m; i++) {
        Answer(res[i]);
    }
}

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 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 348 KB Output is correct
2 Correct 9 ms 348 KB Output is correct
3 Correct 8 ms 376 KB Output is correct
4 Correct 6 ms 348 KB Output is correct
5 Correct 9 ms 552 KB Output is correct
6 Correct 9 ms 348 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 660 KB Output is correct
2 Correct 216 ms 604 KB Output is correct
3 Correct 238 ms 632 KB Output is correct
4 Correct 250 ms 632 KB Output is correct
5 Correct 226 ms 600 KB Output is correct
6 Correct 214 ms 856 KB Output is correct

Subtask #4
0 / 78.0

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