Codeforces Round 772

发表于 | 分类于 | 阅读次数: |

Codeforces Round #772 (Div. 2)

比赛链接

A:Min Or Sum

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
#include <iostream>
#include <vector>
using namespace std;


int main()
{
    int t;
    cin >> t;
    while(t--) {
        int n;
        cin >> n;
        vector<int>vec;
        int ans = 0;
        for (int i = 0; i < n; i++) {
            int x;
            cin >> x;
            ans = ans|x;
        }
        cout << ans << endl;
    }
    return 0;
}

B:Avoid Local Maximums

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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include <iostream>
#include <vector>
#include <math.h>
using namespace std;


int main()
{
    int t;
    cin >> t;
    int n;
    int ans;
    vector<int>vec; //存当前数据
    vector<int>sign;//标记
    while(t--) {
        cin >> n;
        vec.clear();
        sign.clear();
        ans = 0;    //答案
        for (int i = 0; i < n; i++) {
            int x;
            cin >> x;
            vec.push_back(x);
            sign.push_back(0);
        }
        //计算标记数组
        for (int i = 1; i < n - 1; i++) {
            if(vec[i] > vec[i-1] && vec[i] > vec[i+1]) {
                sign[i] = 1;
            }
        }
        for (int i = 1; i < n - 1; i++) {
            if(sign[i]) {
                if(i+2< n && sign[i+2]) {
                    ans ++;
                    vec[i+1] = max(vec[i], vec[i+2]);
                    sign[i+2] = 0;
                    sign[i] = 0;
                } else {
                    ans ++;
                    vec[i] = max(vec[i-1], vec[i+1]);
                    sign[i] = 0;
                }
            }
        }
        cout << ans << endl;
        for (int i = 0; i < n - 1; i++) {
            cout << vec[i] << " ";
        }
        cout << vec[n-1]<< endl;
    }
    return 0;
}

C:Differential Sorting

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
31
32
33
34
#include <iostream>
#include <bits/stdc++.h>
#include <map>
#include <algorithm>
using namespace std;

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int n;
        vector<int>vec;
        cin >> n;
        for (int i = 0; i < n; i++) {
            int tmp;
            cin >> tmp;
            vec.push_back(tmp);
        }
        if(vec[n-2] <= vec[n-1] && vec[n-1] >= 0) {
            cout << n - 2 << endl;
            for(int i = 0; i < n-2; i++) {
                cout << i + 1 << " " << n-1 << " " << n << endl;
            }
        }else if(is_sorted(vec.begin(), vec.end())) {
            cout << "0" << endl;
        } else {
            cout << "-1" << endl;
        }

    }
    return 0;
}