AtCoder Beginner Contest 444

1
#include<bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4
typedef unsigned long long ull;
5
typedef pair<int,int> PII;
6
#define MP make_pair
7
#define fi first
8
#define se second
9
#define pb push_back
10
#define eb emplace_back
11
#define SET(a,b) memset(a,b,sizeof(a))
12
#define CPY(a,b) memcpy(a,b,sizeof(b))
13
#define rep(i,j,k) for(int i=(j);i<=(k);++i)
14
#define per(i,j,k) for(int i=(j);i>=(k);--i)
15
int read() {
16
   int a=0, f=1; char c=getchar();
17
   while(!isdigit(c)) {
18
       if(c=='-') f=-1;
19
       c=getchar();
20
   }
21
   while(isdigit(c)) a=a*10+c-'0', c=getchar();
22
   return a*f;
23
}
24
signed main() {
25
    ios::sync_with_stdio(0);
26
    cin.tie(0);
27
    cout.tie(0);
28
    string s;
29
    cin >> s;
30
    if(s[0] == s[1] && s[1] == s[2] && s[0] == s[1]) {
31
        cout << "Yes" << endl;
32
    } else cout << "No" << endl;
33
    return 0;
34
}

1
#include<bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4
typedef unsigned long long ull;
5
typedef pair<int,int> PII;
6
#define MP make_pair
7
#define fi first
8
#define se second
9
#define pb push_back
10
#define eb emplace_back
11
#define SET(a,b) memset(a,b,sizeof(a))
12
#define CPY(a,b) memcpy(a,b,sizeof(b))
13
#define rep(i,j,k) for(int i=(j);i<=(k);++i)
14
#define per(i,j,k) for(int i=(j);i>=(k);--i)
15
int read() {
16
   int a=0, f=1; char c=getchar();
17
   while(!isdigit(c)) {
18
       if(c=='-') f=-1;
19
       c=getchar();
20
   }
21
   while(isdigit(c)) a=a*10+c-'0', c=getchar();
22
   return a*f;
23
}
24
int n, k;
25
int calc(int x) {
26
    int res = 0;
27
    while(x) {
28
        res += x % 10;
29
        x /= 10;
30
    }
31
    return res;
32
}
33
signed main() {
34
    ios::sync_with_stdio(0);
35
    cin.tie(0);
36
    cout.tie(0);
37
    cin >> n >> k;
38
    int ans = 0;
39
    for(int i = 1;i <= n;i++) {
40
        if(calc(i) == k) ans++;
41
    }
42
    cout << ans << endl;
43
    return 0;
44
}

1
#include<bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4
typedef unsigned long long ull;
5
typedef pair<int,int> PII;
6
#define MP make_pair
7
#define fi first
8
#define se second
9
#define pb push_back
10
#define eb emplace_back
11
#define SET(a,b) memset(a,b,sizeof(a))
12
#define CPY(a,b) memcpy(a,b,sizeof(b))
13
#define rep(i,j,k) for(int i=(j);i<=(k);++i)
14
#define per(i,j,k) for(int i=(j);i>=(k);--i)
15
int read() {
16
   int a=0, f=1; char c=getchar();
17
   while(!isdigit(c)) {
18
       if(c=='-') f=-1;
19
       c=getchar();
20
   }
21
   while(isdigit(c)) a=a*10+c-'0', c=getchar();
22
   return a*f;
23
}
24
const int N = 3e5 + 5;
25
int n, a[N];
26
map<int, bool> mp;
27
vector<int> ans;
28
signed main() {
29
    ios::sync_with_stdio(0);
30
    cin.tie(0);
31
    cout.tie(0);
32
    cin >> n;
33
    for(int i = 1;i <= n;i++) {
34
        cin >> a[i];
35
    }
36
    sort(a + 1, a + n + 1);
37
    int k = 0;
38
    if(n > 1) {
39
        k = a[1] + a[n];
40
        int l = 2, r = n - 1;
41
        while(l <= r) {
42
            if(l == r) break;
43
            if(a[l] + a[r] != k) break;
44
            l++;
45
            r--;
46
        }
47
        if(l > r) ans.pb(k);
48
    }
49
    int p = n - 1;
50
    if(a[1] == a[n]) {
51
        ans.pb(a[n]);
52
        p = 0;
53
    }
54
    while(p > 1 && a[p] == a[n]) p--;
55
    if(p > 1 && a[1] + a[p] == a[n]) {
56
        int l = 2, r = p - 1;
57
        k = a[n];
58
        while(l <= r) {
59
            if(l == r) break;
60
            if(a[l] + a[r] != k) break;
61
            l++;
62
            r--;
63
        }
64
        if(l > r) ans.pb(k);
65
    }
66
    sort(ans.begin(), ans.end());
67
    for(auto x : ans) cout << x << " ";
68
    cout << endl;
69
    return 0;
70
}

1
#include<bits/stdc++.h>
2
using namespace std;
3
typedef long long ll;
4
typedef unsigned long long ull;
5
typedef pair<int,int> PII;
6
#define MP make_pair
7
#define fi first
8
#define se second
9
#define pb push_back
10
#define eb emplace_back
11
#define SET(a,b) memset(a,b,sizeof(a))
12
#define CPY(a,b) memcpy(a,b,sizeof(b))
13
#define rep(i,j,k) for(int i=(j);i<=(k);++i)
14
#define per(i,j,k) for(int i=(j);i>=(k);--i)
15
int read() {
16
   int a=0, f=1; char c=getchar();
17
   while(!isdigit(c)) {
18
       if(c=='-') f=-1;
19
       c=getchar();
20
   }
21
   while(isdigit(c)) a=a*10+c-'0', c=getchar();
22
   return a*f;
23
}
24
const int N = 2e5 + 5;
25
int n, m, a[N];
26
string ans;
27
void add(int p, int x) {
28
    if(x == 0) return;
29
    if(ans[p] - '0' + x < 10) {
30
        ans[p] = ans[p] + x;
31
        return;
32
    } else {
33
        int t = (ans[p] - '0' + x) % 10;
34
        ans[p] = t + '0';
35
        add(p + 1, 1);
36
    }
37
}
38
signed main() {
39
    ios::sync_with_stdio(0);
40
    cin.tie(0);
41
    cout.tie(0);
42
    cin >> n;
43
    for(int i = 1;i <= n;i++) {
44
        cin >> a[i];
45
        m = max(m, a[i]);
46
    }
47
    sort(a + 1, a + n + 1);
48
    ans.resize(m + n);
49
    for(int i = 0;i <= m + n;i++) ans[i] = '0';
50
    int mxp = 0;
51
    for(int j = 0;j < m;j++) {
52
        int cnt = n - (upper_bound(a + 1, a + n + 1, j) - a - 1);
53
        int i = j, x = cnt;
54
        while(x) {
55
            add(i, x % 10);
56
            x /= 10;
57
            mxp = max(mxp, i);
58
            i++;
59
        }
60
    }
61
    for(int i = mxp;~i;i--) {
62
        cout << ans[i];
63
    }
64
    cout << endl;
65
    return 0;
66
}

1
#include<bits/stdc++.h>
2
using namespace std;
3
using ll=long long;
4

5
int main(){
6
  int n,d;
7
  cin >> n >> d;
8
  vector<int>a(n);
9
  for(auto&x:a)cin >> x;
10

11
  ll ans=0;
12
  set<ll>s({(ll)-1e9,(ll)2e9});
13
    // 显然我观察到了小区间不行会直接导致大区间不行，这就是标准的双指针模板，但是我干了啥啊草
14
  int r=0;
15
  for(int l=0;l<n;l++){
16
    while(r<n){
17
      auto it=s.lower_bound(a[r]);
18
      if(*it-a[r]<d)break;
19
      it--;
20
      if(a[r]-*it<d)break;
21
      s.insert(a[r]);
22
      r++;
23
    }
24
    ans+=r-l;
25
    s.erase(a[l]);
26
  }
27
  cout << ans << endl;
28
}