제출 #1057237

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1057237		modwwe	Fire (BOI24_fire)	C++14	48 / 100	83 ms	21728 KiB

Main

//https://www.instagram.com/_modwwe/
#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 NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
void phongbeo();
const ll inf=1e9;
const int mod2=1e9+7;
const int  mod1=998244353;
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c,d,e;

};

int n,m,s1,s2,s4,s3,sf,k,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,s33,dem3,l,r,mid;
int  i,s10,s12;
int kk;
int el=29;

main()
{
#ifndef ONLINE_JUDGE
//fin(task),fou(task);
#endif
    NHP
    /// cin>>s1;
    //  modwwe
    phongbeo();
}
ib a[200001];
int b[200001];
int st[18][200001];
vector<int> v;
void phongbeo()
{
    cin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        cin>>a[i].a>>a[i].b,v.pb(a[i].a);
        if(a[i].b<a[i].a) a[i].b+=m,v.pb(a[i].b);
    }
    sort(v.begin(),v.end());
    for(int i=1; i<=n; i++)
        a[i].a=lower_bound(v.begin(),v.end(),a[i].a)-v.begin()+1,
            a[i].b=upper_bound(v.begin(),v.end(),a[i].b)-v.begin(),
                b[a[i].a]=max(a[i].b,b[a[i].a]),
                          s3=max(s3,a[i].b);
    for(int i=1; i<=n; i++)
        b[i]=max(b[i],b[i-1]),
             st[0][i]=b[i];
    for(int i=1; i<18; i++)
        for(int j=1; j<=n; j++)
            if(st[i-1][j]>n)st[i][j]=s3;
            else st[i][j]=st[i-1][st[i-1][j]];
    s6=inf;
    for(int i=1; i<=n; i++)
    {
        if(v[s3-1]-m<v[i-1])break;
        s4=0;
        s5=i;
        for(int j=17; j>=0; --j)
            if(v[st[j][s5]-1]-m<v[i-1])
                s5=st[j][s5],
                s4+=(1<<j);
        if(s5>n)s5=s3;
        else s5=st[0][s5];
        s4++;
        if(v[s5-1]-m>=v[i-1])s6=min(s6,s4);
    }
    if(s6==inf) cout<<-1;
    else
    cout<<s6;
}

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

Main.cpp:51:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   51 | main()
      | ^~~~

• Subtask 1: 14 / 14
• Subtask 2: 0 / 17
• Subtask 3: 0 / 9
• Subtask 4: 13 / 13
• Subtask 5: 21 / 21
• Subtask 6: 0 / 26