제출 #988472

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
988472	2024-05-24 19:18:19	amirhoseinfar1385	Escape Route 2 (JOI24_escape2)	C++17	100 / 100	1643 ms	310400 KiB

Main

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;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
const int maxn=100000+10,maxq=300000+10,lg=20,sq=100,msq=maxn/sq+10;
int t,n,q;
long long inf=1e16;
vector<pair<int,int>>all[maxn];
vector<int>dp[maxn],lnk[lg][maxn],allp;
vector<long long>wlnk[lg][maxn];
long long res[msq][maxn];
vector<long long>allz[maxn];
void vorod(){
  cin>>n>>t;
  for(int i=1;i<n;i++){
    int d;
    cin>>d;
    all[i].resize(d);
    if(d>=sq){
      allp.push_back(i);
    }
    for(int j=0;j<d;j++){
      cin>>all[i][j].first>>all[i][j].second;
    }
    sort(all[i].begin(),all[i].end());
    dp[i].resize(d);
    for(int j=0;j<lg;j++){
      lnk[j][i].resize(d);
      wlnk[j][i].resize(d);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 6 / 6
• Subtask 2: 8 / 8
• Subtask 3: 17 / 17
• Subtask 4: 23 / 23
• Subtask 5: 36 / 36
• Subtask 6: 10 / 10