Submission #564474

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
564474	2022-05-19 09:31:43	keta_tsimakuridze	Election (BOI18_election)	C++14	100 / 100	901 ms	49808 KiB

election

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 int long long
#define pii pair<int,int>
#define f first
#define s second
#define endl "\n"
const int N = 5e5 + 5, mod = 1e9 + 7; //!
int t[N], t2[N], p[N], tree[4 * N], lazy[4 * N], ans[N];
vector<pair<int,int> > x[N];
void push(int u ,int l,int r) {
  tree[u] += lazy[u];
  if(l != r) lazy[2 * u] += lazy[u], lazy[2 * u + 1] += lazy[u];
  lazy[u] = 0;
  return;
}
void upd(int u, int st, int en, int l,int r,int v) {
  if(lazy[u]) push(u, l, r);
  if(l > en || r < st) return;
  if(st <= l && r <= en) {
    lazy[u] = v;
    push(u, l, r);
    return;
  }
  int mid = (l + r) / 2;
  upd(2 * u, st, en, l, mid, v); upd(2 * u + 1, st, en, mid + 1, r, v);
  tree[u] = max(tree[2 * u], tree[2 * u + 1]);
}
int get(int u, int st,int en, int l,int r) {
  if(lazy[u]) push(u, l, r);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

election.cpp: In function 'void upd(int, int)':
election.cpp:37:6: warning: statement has no effect [-Wunused-value]
   37 |  for(id; id >= 1; id -= id & (-id)) t[id] += val;
      |      ^~
election.cpp: In function 'int get(int)':
election.cpp:41:6: warning: statement has no effect [-Wunused-value]
   41 |  for(id; id <= n; id += id & (-id)) ans += t[id];
      |      ^~
election.cpp: In function 'void UPD(int, int)':
election.cpp:45:6: warning: statement has no effect [-Wunused-value]
   45 |  for(id; id >= 1; id -= id & (-id)) t2[id] += val;
      |      ^~
election.cpp: In function 'int GET(int)':
election.cpp:49:6: warning: statement has no effect [-Wunused-value]
   49 |  for(id; id <= n; id += id & (-id)) ans += t2[id];
      |      ^~
election.cpp: At global scope:
election.cpp:52:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   52 | main() {
      | ^~~~
election.cpp: In function 'int main()':
election.cpp:73:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |    if(l == v.size()) {
      |       ~~^~~~~~~~~~~
election.cpp:82:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |   while(l < v.size() && p[v[l]] - p[i - 1] > 0)  upd(1, 1, v[l], 1, n, -1), upd(v[l], -1), UPD(v[l], 1),  ++l;
      |         ~~^~~~~~~~~~
election.cpp:87:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |   for(int j = 0; j < x[i].size(); j++) {
      |                  ~~^~~~~~~~~~~~~

• Subtask 1: 28 / 28
• Subtask 2: 54 / 54
• Subtask 3: 18 / 18