Submission #292914

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
292914	2020-09-07 14:47:25	arnold518	Monochrome Points (JOI20_monochrome)	C++14	35 / 100	2079 ms	12160 KiB

monochrome

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<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2e5;
int N;
char S[MAXN*2+10];
int A[MAXN+10], B[MAXN+10], L[MAXN*2+10], R[MAXN*2+10];
ll P[MAXN+10], ans, off;
ll tree[MAXN+10];
void init() { memset(tree, 0, sizeof(tree)); }
void update(int i, int k) { for(; i<=N; i+=(i&-i)) tree[i]+=k; }
ll query(int i) { ll ret=0; for(i=R[i]+1; i>0; i-=(i&-i)) ret+=tree[i]; return ret; }
void update2(int l, int r, int k)
{
  //printf("%d %d -> %d %d\n", l, r, R[l]+1, L[r]+1);
  l=R[l]+1; r=L[r]+1;
  if(l<=r) update(l, k), update(r+1, -k);
  else update(l, k), update(r+1, -k), update(1, k);
}
int maxcnt;
struct dequeue
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

monochrome.cpp: In member function 'bool dequeue::empty()':
monochrome.cpp:38:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |  bool empty() { return pt==V.size(); }
      |                        ~~^~~~~~~~~~
monochrome.cpp: In function 'll f(int)':
monochrome.cpp:46:6: warning: unused variable 'p' [-Wunused-variable]
   46 |  int p=0, q=0;
      |      ^
monochrome.cpp:46:11: warning: unused variable 'q' [-Wunused-variable]
   46 |  int p=0, q=0;
      |           ^
monochrome.cpp: In function 'int main()':
monochrome.cpp:71:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   71 |  scanf("%d", &N);
      |  ~~~~~^~~~~~~~~~
monochrome.cpp:72:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   72 |  scanf(" %s", S+1);
      |  ~~~~~^~~~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 21 / 21
• Subtask 3: 10 / 10
• Subtask 4: 0 / 65