제출 #991027

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
991027	2024-06-01 05:07:05	WongChun1234	자리 배치 (IOI18_seats)	C++14	33 / 100	1496 ms	100996 KiB

seats

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<bits/stdc++.h>
#include "seats.h"
using namespace std;
#define lc (id<<1)
#define rc ((id<<1)|1)
#define defm int m=((l+r)>>1)
const int N=1000050;
int n,h,w,r[N],c[N];
vector<int> a[N];
struct node{
  int mn,cnt,bad,lzmn,lzbad;
}seg[N<<2];
node merge(node a,node b){
  int currmn=1e9,cnt=0,mnn=min(a.bad,b.bad);
  if (a.bad==mnn){
    currmn=a.mn,cnt=a.cnt;
  }
  if (b.bad==mnn){
    if (b.mn<currmn){
      currmn=b.mn,cnt=b.cnt;
    }else if (b.mn==currmn){
      cnt+=b.cnt;
    }
  }
  return {currmn,cnt,mnn,0,0};
}
void pushmn(int id,int mult){
  seg[id].lzmn+=mult;
  seg[id].mn+=mult;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 5
• Subtask 2: 0 / 6
• Subtask 3: 0 / 20
• Subtask 4: 0 / 6
• Subtask 5: 33 / 33
• Subtask 6: 0 / 30