Submission #667158

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
667158	2022-11-30 14:14:22	havij	Toll (BOI17_toll)	C++17	0 / 100	330 ms	524288 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;
 
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
 
const ll MAXN = 5e4 + 20;
const ll MOD = 1e9 + 7;
const ll INF = 1e17;
 
#define pb push_back
#define Mp make_pair
#define F first
#define S second
#define Sz(x) int((x).size())
#define endll '\n'
ll dp[10][MAXN], ans[MAXN], n, k;
vector <pii> adj[MAXN], adj2[MAXN];
vector <pair <pii, int>> vec[4 * MAXN];
void find(int ind, int l, int r, int s = 0, int e = (n - 1) / k + 1){
    int mid = (s + e) / 2, L = mid * k, R = L + k;
    if(l <= R && r >= L) vec[mid].pb(Mp(Mp(l, r), ind)); return;
    if(r < L) find(ind, l, r, s, mid);
    else find(ind, l, r, mid, e);
}
void upd(int s, int e, bool f){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

toll.cpp: In function 'void find(int, int, int, int, int)':
toll.cpp:25:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   25 |     if(l <= R && r >= L) vec[mid].pb(Mp(Mp(l, r), ind)); return;
      |     ^~
toll.cpp:25:58: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   25 |     if(l <= R && r >= L) vec[mid].pb(Mp(Mp(l, r), ind)); return;
      |                                                          ^~~~~~

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