제출 #973550

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
973550	2024-05-02 07:04:18	happy_node	Super Dango Maker (JOI22_dango3)	C++17	22 / 100	2601 ms	250576 KiB

dango3

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 2 / 2
• Subtask 2: 5 / 5
• Subtask 3: 15 / 15
• Subtask 4: 0 / 78