oj.uz

답안 #973531

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
973531 2024-05-02T06:46:39 Z happy_node Super Dango Maker (JOI22_dango3) C++17
7 / 100
 1661 ms 584 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;

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);
        }
        return 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 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 348 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 348 KB Output is correct
2 Correct 38 ms 348 KB Output is correct
3 Correct 40 ms 348 KB Output is correct
4 Correct 40 ms 492 KB Output is correct
5 Correct 38 ms 484 KB Output is correct
6 Correct 37 ms 348 KB Output is correct

Subtask #3
0 / 15.0

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

Subtask #4
0 / 78.0

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