Submission #441462

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
441462	2021-07-05T08:26:18 Z	abc864197532	Alternating Current (BOI18_alternating)	C++17	13 / 100	3000 ms	9060 KB

alternating

#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;
    double t = clock();
    vector <int> p(m);
    iota(all(p), 0);
    while (clock() - t <= 2900) {
        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

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Correct	1 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	1 ms	204 KB	Output is correct
8	Correct	3 ms	316 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	3 ms	204 KB	Output is correct
11	Correct	4 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	4 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 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	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	2 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	316 KB	Output is correct
27	Correct	3 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	4 ms	204 KB	Output is correct
30	Correct	4 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Correct	3 ms	204 KB	Output is correct
33	Correct	0 ms	204 KB	Output is correct
34	Correct	4 ms	204 KB	Output is correct
35	Correct	4 ms	208 KB	Output is correct
36	Correct	1 ms	204 KB	Output is correct
37	Correct	1 ms	204 KB	Output is correct
38	Correct	3 ms	204 KB	Output is correct
39	Correct	1 ms	204 KB	Output is correct
40	Correct	1 ms	204 KB	Output is correct

Subtask #2
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Correct	1 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	1 ms	204 KB	Output is correct
8	Correct	3 ms	316 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	3 ms	204 KB	Output is correct
11	Correct	4 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	4 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 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	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	2 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	316 KB	Output is correct
27	Correct	3 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	4 ms	204 KB	Output is correct
30	Correct	4 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Correct	3 ms	204 KB	Output is correct
33	Correct	0 ms	204 KB	Output is correct
34	Correct	4 ms	204 KB	Output is correct
35	Correct	4 ms	208 KB	Output is correct
36	Correct	1 ms	204 KB	Output is correct
37	Correct	1 ms	204 KB	Output is correct
38	Correct	3 ms	204 KB	Output is correct
39	Correct	1 ms	204 KB	Output is correct
40	Correct	1 ms	204 KB	Output is correct
41	Correct	1 ms	204 KB	Output is correct
42	Correct	2 ms	204 KB	Output is correct
43	Incorrect	3 ms	204 KB	'impossible' claimed, but there is a solution
44	Halted	0 ms	0 KB	-

Subtask #3
0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Correct	1 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	1 ms	204 KB	Output is correct
8	Correct	3 ms	316 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	3 ms	204 KB	Output is correct
11	Correct	4 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	4 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 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	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	2 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	316 KB	Output is correct
27	Correct	3 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	4 ms	204 KB	Output is correct
30	Correct	4 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Correct	3 ms	204 KB	Output is correct
33	Correct	0 ms	204 KB	Output is correct
34	Correct	4 ms	204 KB	Output is correct
35	Correct	4 ms	208 KB	Output is correct
36	Correct	1 ms	204 KB	Output is correct
37	Correct	1 ms	204 KB	Output is correct
38	Correct	3 ms	204 KB	Output is correct
39	Correct	1 ms	204 KB	Output is correct
40	Correct	1 ms	204 KB	Output is correct
41	Correct	1 ms	204 KB	Output is correct
42	Correct	2 ms	204 KB	Output is correct
43	Incorrect	3 ms	204 KB	'impossible' claimed, but there is a solution
44	Halted	0 ms	0 KB	-

Subtask #4
0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	36 ms	9060 KB	Output is correct
2	Correct	10 ms	7244 KB	Output is correct
3	Execution timed out	3068 ms	8268 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #5
0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	312 KB	Output is correct
3	Correct	1 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	1 ms	204 KB	Output is correct
8	Correct	3 ms	316 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	3 ms	204 KB	Output is correct
11	Correct	4 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	4 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 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	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	2 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	316 KB	Output is correct
27	Correct	3 ms	204 KB	Output is correct
28	Correct	0 ms	204 KB	Output is correct
29	Correct	4 ms	204 KB	Output is correct
30	Correct	4 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Correct	3 ms	204 KB	Output is correct
33	Correct	0 ms	204 KB	Output is correct
34	Correct	4 ms	204 KB	Output is correct
35	Correct	4 ms	208 KB	Output is correct
36	Correct	1 ms	204 KB	Output is correct
37	Correct	1 ms	204 KB	Output is correct
38	Correct	3 ms	204 KB	Output is correct
39	Correct	1 ms	204 KB	Output is correct
40	Correct	1 ms	204 KB	Output is correct
41	Correct	1 ms	204 KB	Output is correct
42	Correct	2 ms	204 KB	Output is correct
43	Incorrect	3 ms	204 KB	'impossible' claimed, but there is a solution
44	Halted	0 ms	0 KB	-

Submission #441462

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 0 / 20.0

Subtask #3 0 / 22.0

Subtask #4 0 / 19.0

Subtask #5 0 / 26.0

Subtask #1
13.0 / 13.0

Subtask #2
0 / 20.0

Subtask #3
0 / 22.0

Subtask #4
0 / 19.0

Subtask #5
0 / 26.0