oj.uz

답안 #973550

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
973550 2024-05-02T07:04:18 Z happy_node Super Dango Maker (JOI22_dango3) C++17
22 / 100
 2601 ms 250576 KB 
#include "dango3.h"

#include <bits/stdc++.h>
using namespace std;

const int MX=400*25+5;

bool used[MX], onstk[MX];

int N,M;

map<vector<int>,int> memo;

int ask(int l, int r) {
        vector<int> qry;
        for(int i=l;i<=r;i++) {
                if(used[i]||onstk[i]) continue;
                qry.push_back(i);
        }
        for(int i=1;i<=N*M;i++) {
                if(onstk[i]) qry.push_back(i);
        }
        sort(qry.begin(),qry.end());
        if(memo.count(qry)) return memo[qry];
        return memo[qry]=Query(qry);
}       

void Solve(int NN, int MM) {
        N=NN, M=MM;
        for(int i=1;i<=M;i++) {
                vector<int> v;
                int lst=N*M;
                for(int j=1;j<=N;j++) {
                        int l=1,r=lst,res=0;
                        while(l<=r) {
                                int mid=(l+r)/2;
                                if(ask(1,mid)>=1) {
                                        res=mid,r=mid-1;
                                } else {
                                        l=mid+1;
                                }
                        }
                        v.push_back(res);
                        onstk[res]=true;
                        lst=res-1;
                }
                Answer(v);
                for(auto x:v) {
                        onstk[x]=false;
                        used[x]=true;
                }
        }
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 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 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 4896 KB Output is correct
2 Correct 38 ms 4600 KB Output is correct
3 Correct 112 ms 10140 KB Output is correct
4 Correct 86 ms 10112 KB Output is correct
5 Correct 27 ms 3164 KB Output is correct
6 Correct 29 ms 3108 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 750 ms 66032 KB Output is correct
2 Correct 820 ms 65992 KB Output is correct
3 Correct 2601 ms 250532 KB Output is correct
4 Correct 2587 ms 250576 KB Output is correct
5 Correct 497 ms 31968 KB Output is correct
6 Correct 695 ms 31624 KB Output is correct

Subtask #4
0 / 78.0

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