Submission #815978

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
815978	2023-08-09 03:11:36	acatmeowmeow	Zoltan (COCI16_zoltan)	C++11	140 / 140	143 ms	16256 KiB

zoltan

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 
const int N = 2e5, modulo = 1e9 + 7;
int n, x[N + 5], y[N + 5];
pair<int, int> dp[N + 5], dp2[N + 5], tree[N + 5];
vector<int> mp;
pair<int, int> combine(pair<int, int>&a, pair<int, int>&b) {
  if (a.first == b.first) return {a.first, (a.second + b.second) % modulo}; 
  else return a > b ? a : b;
}
void update(int k, pair<int, int>x) {
  for (; k <= n; k += k&-k) tree[k] = combine(tree[k], x);
}
pair<int, int> query(int k) {
  pair<int, int> ans = {0, 0};
  for (; k; k -= k&-k) ans = combine(ans, tree[k]);
  return ans;
}
int binpow(int n, int k) {
  if (!k) return 1;
  else {
    int ans = binpow(n, k/2);
    ans *= ans, ans %= modulo;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 140 / 140