제출 #361884

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
361884	2021-01-31 20:41:44	ogibogi2004	Toll (BOI17_toll)	C++14	100 / 100	221 ms	35440 KiB

toll

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>
using namespace std;
#define ll long long
const ll MAXN=5e4+6;
const ll INF=1e15;
const ll logN=18;
const ll MAXK=6;
struct query
{
  ll lb,rb,lk,rk;
  ll pos;
};
ll ans[2*MAXN],n,m,k;
ll prefL[MAXN][MAXK][MAXK];
ll prefR[MAXN][MAXK][MAXK];
ll matrix1[MAXN][MAXK];
ll matrix2[MAXN][MAXK];
void dq(ll l,ll r,vector<query>q)
{
  if(q.size()==0)return;
  ll mid=(l+r)/2;
  for(ll i1=0;i1<k;i1++)
  {
    for(ll i2=0;i2<k;i2++)
    {
      prefR[mid][i1][i2]=INF;
      prefL[mid][i1][i2]=INF;
    }
  }
  for(ll i=0;i<k;i++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 7 / 7
• Subtask 2: 10 / 10
• Subtask 3: 8 / 8
• Subtask 4: 31 / 31
• Subtask 5: 44 / 44