제출 #1178125

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1178125		8pete8	Minerals (JOI19_minerals)	C++17	25 / 100	20 ms	1264 KiB

minerals

#include "minerals.h"
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<cassert>
#include<unordered_map>
#include <queue>
#include <cstdint>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
const ll inf=1e9,mxn=1e5;
/*
dnc + parallel bsearch?
*/
int done[mxn+10],ans[mxn+10];
pii bound[mxn+10];
int cl,cr,cs=0;
void move(int l,int r){
  while(cr<r){
    if(!done[++cr])cs=Query(cr);
    else cs++;
  }
  while(cr>r){
    if(!done[cr--])cs=Query(cr+1);
    else cs--;
  }
  while(cl<l){
    if(!done[cl++])cs=Query(cl-1);
    else cs--;
  }
  while(cl>l){
    if(!done[--cl])cs=Query(cl);
    else cs++;
  }
}
void solve(int l,int r){
  int c=0;
  for(int j=l;j<=r;j++)if(!done[j])c++;
  if(c<=1)return;
  int mid=l+(r-l)/2;
  move(mid+1,r);
  vector<int>have;
  
  for(int i=l;i<=mid;i++)if(!done[i]){
    if(Query(i)==cs)have.pb(i);
    else Query(i);
  }
  for(auto i:have){
    bound[i].f=mid+1,bound[i].s=r,ans[i]=mid;
  }
  for(int k=0;k<20;k++){
    vector<pii>q;
    for(auto i:have)if(bound[i].f<=bound[i].s){
      q.pb({(bound[i].s+bound[i].f)/2,i});
    }
    if(q.empty())break;
    sort(rall(q));
    for(auto j:q){
      move(mid+1,j.f);
      if(Query(j.s)==cs-1){
        ans[j.s]=max(ans[j.s],j.f);
        bound[j.s].f=j.f+1;
      }
      else bound[j.s].s=j.f-1;
      Query(j.s);
    }
  }
  for(auto i:have){
    done[i]=1;
    done[ans[i]+1]=1;
    Answer(i,ans[i]+1);
    Query(i);
  }
  solve(l,mid);
  solve(mid+1,r);
}
void Solve(int n){
  n*=2;
  int mid=1+(n-1)/2;
  for(int i=mid+1;i<=n;i++)cs=Query(i);
  cl=mid+1,cr=n;
  solve(1,n);
}
/*
p bs?
*/

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

minerals.cpp:33:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   33 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
minerals.cpp:41:22: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   41 | void move(int l,int r){
      |                      ^
minerals.cpp:59:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   59 | void solve(int l,int r){
      |                       ^
minerals.cpp:100:17: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
  100 | void Solve(int n){
      |                 ^

• Subtask 1: 0 / 6
• Subtask 2: 25 / 25
• Subtask 3: 0 / 9
• Subtask 4: 0 / 30
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 10