제출 #1319611

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1319611		Sir_Ahmed_Imran	Super Dango Maker (JOI22_dango3)	C++17	100 / 100	1748 ms	736 KiB

dango3

#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ff first
#define ss second
#define ll long long
#define ld long double
#define terminator main
#define pll pair<ll,ll>
#define add insert
#define append push_back
#define pii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

int vis[10002];
vector<int> a[25];

bool check(int n, int m, int i, int x){
    if(a[x].empty())
        return 1;
    vector<int> v;
    for(auto & j : a[x])
        vis[j] = 1;
    vis[i] = 1;
    for(int i = 1; i <= n * m; i++){
        if(vis[i]) vis[i] = 0;
        else v.append(i);
    }
    return (Query(v) == m - 1);
}

void Solve(int n, int m){
    int x;
    for(int i = 1; i <= n * m; i++){
        x = 0;
        for(int j = 16; j > 0; j /= 2)
            if(x + j < m && check(n, m, i, x + j)) 
                x += j;
        a[x].append(i);
    }
    for(int i = 0; i < m; i++)
        Answer(a[i]);
}

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