1
#include <cstdio>
2
#include <algorithm>
3
#include <cstring>
4
#include <cmath>
5
#include <cctype>
6
#include <iostream>
7
using namespace std;
8

9
const int maxn = 1e6 + 17;
10
int T, n, a[maxn], b[maxn], tm[maxn];
11

12
int main() {
13
  cin >> T;
14
  while(T--) {
15
    cin >> n;
16
    for(int i = 1; i <= n; i++) cin >> a[i] >> b[i];
17
    for(int i = 1; i <= n; i++) cin >> tm[i];
18
    int t = 0;
19
    for(int i = 1; i <= n; i++) {
20
      t += a[i] - b[i - 1] + tm[i];
21
      if(i == n) break;
22
      t += (b[i] - a[i] + 1) / 2;
23
      if(t < b[i]) t = b[i];
24
    }
25
    cout << t <<endl;
26
  }
27

28
  return 0;
29
}

1
#include <cstdio>
2
#include <algorithm>
3
#include <cstring>
4
#include <cmath>
5
#include <cctype>
6
#include <vector>
7
#include <iostream>
8
using namespace std;
9

10
#define mp make_pair
11
typedef pair<int, int> pii;
12
vector<pii> v;
13
const int maxn = 1e6 + 17;
14

15
int T, n, a[maxn];
16

17
bool cmp(pii A, pii B) {
18
  return A.first < B.first;
19
}
20

21
int main () {
22
  cin >> T;
23
  while(T--) {
24
    cin >> n;
25
    for(int i = 1; i <= n; i++) a[i] = 0;
26
    int cl = 0, cr = 0;
27

28
    for(int i = 1; i <= n; i++) {
29
      int len;
30
      cin >> len;
31
      if(len) v.push_back(mp(max(1, i - len + 1), i));
32
    }
33
    sort(v.begin(), v.end(), cmp);
34
    int m = v.size();
35
    for(int i = 0; i < m; i++) {
36
      int l = v[i].first, r = v[i].second;
37
      if(r > cr) {
38
        for(int i = max(cr + 1, l); i <= r; i++) a[i] = 1;
39
        if(l > cr) {
40
          cl = l;
41
        }
42
        cr = r;
43
      }
44
    }
45
    for(int i = 1; i <= n; i++) cout << a[i] << " \n"[i == n];
46
    v.clear();
47
  }
48
  return 0;
49
}

1
#include <cstdio>
2
#include <algorithm>
3
#include <cstring>
4
#include <cmath>
5
#include <cctype>
6
#include <vector>
7
#include <iostream>
8
using namespace std;
9

10
const int maxn = 3e6 + 17;
11
const int mx = 2500000;
12
int n, c[maxn], a[maxn];
13
typedef pair<int, int> pii;
14
vector<pii> s[maxn * 2];
15

16
int main() {
17
  cin >> n;
18
  for(int i = 1; i <= n; i++) cin >> a[i];
19
  for(int i = 1; i <= n; i++) {
20
    for(int j = i + 1; j <= n; j++) {
21
      s[a[i] + a[j]].push_back(make_pair(i, j));
22
      if(s[a[i] + a[j]].size() >= 4) {
23

24
      }
25
    }
26
  }
27

28
  return 0;
29

30
}

1
#include <cstdio>
2
#include <iostream>
3
#include <algorithm>
4
using namespace std;
5

6
int main() {
7
    int a, b;
8
    cin >> a >> b;
9
    cout << a * 2 + b << endl;
10
    return 0;
11
}