제출 #1168598

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1168598		modwwe	Super Dango Maker (JOI22_dango3)	C++20	100 / 100	1706 ms	728 KiB

dango3

#include "dango3.h"
//#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
//#define int   long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task2 "top1tst"
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1ll<<k)
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l,int r)
{
    return uniform_int_distribution<int>(l,r)(rd);
}
void phongbeo();
const int inf=1e18;
const int mod2 = 998244353;
//const int base=67;
ll  n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
ll  i, s10, s12,k1,k2,k3,s11,lim,w,l,r,dem5,dem6,dem7,dem9,now,root,q,start,en,t,dem1;
ll kk;
ll el = 19;
vector<int> v[26];
bool nouse[100001];
bool check(vector<int>&a,int x)
{
    for(int i=1;i<=n*m;i++)
        nouse[i]=0;
    for(auto f:a)nouse[f]=1;
    nouse[x]=1;
    vector<int> hihi;
    for(int i=1;i<=n*m;i++)
        if(!nouse[i])hihi.pb(i);
    return Query(hihi)==m-1;
}
void Solve(int N,int M)
{n=N;
m=M;
     for(int i=1;i<=n*m;i++)
     {
       l=1;
       r=dem;
       while(l<=r)
       {
           int mid=l+r>>1;
           if(check(v[mid],i))r=mid-1;
           else l=mid+1;
       }
       if(r==dem){
        dem++;
       }
       v[r+1].pb(i);
     }
     for(int i=1;i<=m;i++)
    Answer(v[i]);
}

컴파일 시 표준 에러 (stderr) 메시지

dango3.cpp:26:15: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   26 | const int inf=1e18;
      |               ^~~~

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