oj.uz

답안 #441466

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
441466 2021-07-05T08:27:51 Z abc864197532 Alternating Current (BOI18_alternating) C++17
13 / 100
 3000 ms 9048 KB 
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define X first
#define Y second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define test(args...) abc("[" + string(#args) + "]", args)
void abc() {cerr << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cerr << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
const int mod = 1e9 + 7, N = 100000;

int main () {
    srand(time(NULL));
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector <pii> a(m);
    for (int i = 0; i < m; ++i) cin >> a[i].X >> a[i].Y, --a[i].X;
    int t = 100000;
    vector <int> p(m);
    iota(all(p), 0);
    while (t--) {
        random_shuffle(all(p));
        vector <vector <bool>> is(n, vector <bool> (2, false));
        vector <int> ans(m, 0);
        int now = 0;
        for (int i : p) {
            ans[i] = now;
            int l, r;
            tie(l, r) = a[i];
            if (l < r) {
                for (int j = l; j < r; ++j) is[j][now] = true;
            } else {
                for (int j = l; j < n; ++j) is[j][now] = true;
                for (int j = 0; j < r; ++j) is[j][now] = true;
            }
            bool ok = true;
            for (int j = 0; j < n; ++j) ok &= is[j][now];
            if (ok) {
                if (now == 1) {
                    for (int i : ans) cout << i;
                    cout << endl;
                    return 0;
                }
                now++;
            }
        }
    }
    cout << "impossible\n";
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 102 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 110 ms 204 KB Output is correct
11 Correct 103 ms 288 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 123 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 123 ms 292 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 101 ms 324 KB Output is correct
30 Correct 91 ms 288 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 84 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 78 ms 204 KB Output is correct
35 Correct 152 ms 288 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 142 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 102 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 110 ms 204 KB Output is correct
11 Correct 103 ms 288 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 123 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 123 ms 292 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 101 ms 324 KB Output is correct
30 Correct 91 ms 288 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 84 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 78 ms 204 KB Output is correct
35 Correct 152 ms 288 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 142 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Incorrect 1872 ms 300 KB 'impossible' claimed, but there is a solution
44 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 102 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 110 ms 204 KB Output is correct
11 Correct 103 ms 288 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 123 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 123 ms 292 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 101 ms 324 KB Output is correct
30 Correct 91 ms 288 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 84 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 78 ms 204 KB Output is correct
35 Correct 152 ms 288 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 142 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Incorrect 1872 ms 300 KB 'impossible' claimed, but there is a solution
44 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 9048 KB Output is correct
2 Correct 13 ms 7244 KB Output is correct
3 Execution timed out 3045 ms 8032 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 102 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 110 ms 204 KB Output is correct
11 Correct 103 ms 288 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 123 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 123 ms 292 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 101 ms 324 KB Output is correct
30 Correct 91 ms 288 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 84 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 78 ms 204 KB Output is correct
35 Correct 152 ms 288 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 142 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Incorrect 1872 ms 300 KB 'impossible' claimed, but there is a solution
44 Halted 0 ms 0 KB -