oj.uz

Submission #1033113

# Submission time Handle Problem Language Result Execution time Memory
1033113 2024-07-24T13:00:43 Z shenfe1 Super Dango Maker (JOI22_dango3) C++17
22 / 100
 10000 ms 1172 KB 
#include "dango3.h"
#include <bits/stdc++.h>
 
using namespace std;
 
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(s) (int)s.size()
#define ppb pop_back
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n,m;
set<int> st;

vector<int> xo(vector<vector<int>> a,int mid){
    for(int i=0;i<=mid;i++){
        for(int j=0;j<sz(a[i]);j++){
            st.erase(a[i][j]);
        }
    }
    vector<int> vec;
    for(int x:st)vec.pb(x);
    for(int i=0;i<=mid;i++){
        for(int j=0;j<sz(a[i]);j++){
            st.insert(a[i][j]);
        }
    }
    return vec;
}

void Solve(int N, int M) {
    n=N,m=M;
    for(int i=1;i<=n*m;i++)st.insert(i);
    vector<vector<int>> a(M);
    for(int i=1;i<=N*M;i++){
        int l=0,r=M-1,res=M-1;
        while(l<=r){
            int m=(l+r)/2;
            a[m].pb(i);
            if(M-Query(xo(a,m))==m+2){
                l=m+1;
            }
            else{
                r=m-1;
                res=m;
            }
            a[m].ppb();
        }
        // cout<<i<<" "<<res<<'\n';
        a[res].pb(i);
    }
    for(int i=0;i<M;i++)Answer(a[i]);
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 416 KB Output is correct
3 Correct 0 ms 344 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

# Verdict Execution time Memory Grader output
1 Correct 197 ms 540 KB Output is correct
2 Correct 191 ms 600 KB Output is correct
3 Correct 119 ms 344 KB Output is correct
4 Correct 119 ms 344 KB Output is correct
5 Correct 136 ms 344 KB Output is correct
6 Correct 150 ms 344 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8301 ms 836 KB Output is correct
2 Correct 9294 ms 1072 KB Output is correct
3 Correct 5025 ms 992 KB Output is correct
4 Correct 5182 ms 928 KB Output is correct
5 Correct 6929 ms 844 KB Output is correct
6 Correct 6636 ms 832 KB Output is correct

Subtask #4
0 / 78.0

# Verdict Execution time Memory Grader output
1 Execution timed out 10065 ms 1172 KB Time limit exceeded
2 Halted 0 ms 0 KB -