oj.uz

답안 #925741

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925741 2024-02-12T08:04:20 Z vjudge1 Joker (BOI20_joker) C++17
14 / 100
 144 ms 856 KB 
//Bismillahir-Rahmanir-Rahim

#include <bits/stdc++.h>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,sse4.1,sse4.2,popcnt,avx,avx2")

#define pb push_back
#define pii pair <int, int>
#define pll pair <long long, long long>
#define pld pair <long double, long double>
#define ll long long
#define ld long double
#define x first
#define y second
#define all(v) v.begin(),v.end()
#define sz(s) (int)s.size()
#define skip continue
#define bpop(x) (ll)__builtin_popcountll(x)

using namespace std;

const int N = 2e3 + 7;
const int M = 1e3 + 7;
const int maxA = 2e6 + 7;
const int inf = 1e9 + 7;
const ll INF = 2e18 + 7;
const int MOD = 1e9 + 7;
const ld eps = 1e-9;

pii dir[] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

#define int long long

pii E[N];
vector <int> g[N];
int n, m, q, dist[N];
bool bfs(int st) {
    queue <int> q;
    q.push(st), dist[st] = 0;
    while (!q.empty()) {
        int v = q.front();
        q.pop();
        for (auto to : g[v]) {
            if (dist[to] == -1)dist[to] = dist[v] + 1, q.push(to);
            else if ((dist[v] + dist[to]) % 2 == 0) {
                //cout << v << ':' << dist[v] << ' ' << to << ':' << dist[to] << '\n';
                return 1;
            }
        }
    }
    return 0;
}
void subtask12() {
    while (q--) {
        int l, r;
        cin >> l >> r;
        for (int i = 1;i <= n;i++)g[i].clear(), dist[i] = -1;
        for (int i = 1;i <= m;i++) {
            if (l <= i && i <= r)skip;
            g[E[i].x].pb(E[i].y), g[E[i].y].pb(E[i].x);
            //cout << E[i].x << ' ' << E[i].y << '\n';
        }
        bool ans = 0;
        for (int i = 1;i <= n;i++) {
            if (dist[i] == -1)ans |= bfs(i);
        }
        cout << (ans ? "YES" : "NO") << '\n';
    }
}
void solve() {
    cin >> n >> m >> q;
    for (int i = 1;i <= m;i++) {
        int x, y;
        cin >> x >> y;
        E[i] = {x, y};
    }
    if (n <= 2000 && m <= 2000 && q <= 2000)subtask12();
}
signed main() {
    //srand(time(NULL));
    ios_base::sync_with_stdio(0);
    cout.tie(0);
    //freopen("tests.in", "r", stdin);
    //freopen("milkorder.out", "w", stdout);
    int test = 1;
    //cin >> test;
    for (int t = 1;t <= test;t++) {
        //cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 424 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 424 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 118 ms 568 KB Output is correct
30 Correct 135 ms 604 KB Output is correct
31 Correct 108 ms 604 KB Output is correct
32 Correct 71 ms 600 KB Output is correct
33 Correct 45 ms 652 KB Output is correct
34 Correct 144 ms 604 KB Output is correct
35 Correct 144 ms 640 KB Output is correct
36 Correct 52 ms 604 KB Output is correct
37 Correct 96 ms 636 KB Output is correct
38 Correct 65 ms 600 KB Output is correct
39 Correct 118 ms 604 KB Output is correct
40 Correct 70 ms 604 KB Output is correct
41 Correct 69 ms 656 KB Output is correct
42 Correct 65 ms 604 KB Output is correct
43 Correct 37 ms 604 KB Output is correct
44 Correct 56 ms 600 KB Output is correct
45 Correct 92 ms 600 KB Output is correct
46 Correct 115 ms 604 KB Output is correct
47 Correct 56 ms 628 KB Output is correct
48 Correct 66 ms 604 KB Output is correct
49 Correct 92 ms 604 KB Output is correct
50 Correct 144 ms 636 KB Output is correct
51 Correct 54 ms 604 KB Output is correct
52 Correct 69 ms 604 KB Output is correct
53 Correct 109 ms 604 KB Output is correct
54 Correct 135 ms 600 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Runtime error 1 ms 604 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 424 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Runtime error 1 ms 604 KB Execution killed with signal 11
30 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 424 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 118 ms 568 KB Output is correct
30 Correct 135 ms 604 KB Output is correct
31 Correct 108 ms 604 KB Output is correct
32 Correct 71 ms 600 KB Output is correct
33 Correct 45 ms 652 KB Output is correct
34 Correct 144 ms 604 KB Output is correct
35 Correct 144 ms 640 KB Output is correct
36 Correct 52 ms 604 KB Output is correct
37 Correct 96 ms 636 KB Output is correct
38 Correct 65 ms 600 KB Output is correct
39 Correct 118 ms 604 KB Output is correct
40 Correct 70 ms 604 KB Output is correct
41 Correct 69 ms 656 KB Output is correct
42 Correct 65 ms 604 KB Output is correct
43 Correct 37 ms 604 KB Output is correct
44 Correct 56 ms 600 KB Output is correct
45 Correct 92 ms 600 KB Output is correct
46 Correct 115 ms 604 KB Output is correct
47 Correct 56 ms 628 KB Output is correct
48 Correct 66 ms 604 KB Output is correct
49 Correct 92 ms 604 KB Output is correct
50 Correct 144 ms 636 KB Output is correct
51 Correct 54 ms 604 KB Output is correct
52 Correct 69 ms 604 KB Output is correct
53 Correct 109 ms 604 KB Output is correct
54 Correct 135 ms 600 KB Output is correct
55 Runtime error 1 ms 856 KB Execution killed with signal 11
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 424 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 118 ms 568 KB Output is correct
30 Correct 135 ms 604 KB Output is correct
31 Correct 108 ms 604 KB Output is correct
32 Correct 71 ms 600 KB Output is correct
33 Correct 45 ms 652 KB Output is correct
34 Correct 144 ms 604 KB Output is correct
35 Correct 144 ms 640 KB Output is correct
36 Correct 52 ms 604 KB Output is correct
37 Correct 96 ms 636 KB Output is correct
38 Correct 65 ms 600 KB Output is correct
39 Correct 118 ms 604 KB Output is correct
40 Correct 70 ms 604 KB Output is correct
41 Correct 69 ms 656 KB Output is correct
42 Correct 65 ms 604 KB Output is correct
43 Correct 37 ms 604 KB Output is correct
44 Correct 56 ms 600 KB Output is correct
45 Correct 92 ms 600 KB Output is correct
46 Correct 115 ms 604 KB Output is correct
47 Correct 56 ms 628 KB Output is correct
48 Correct 66 ms 604 KB Output is correct
49 Correct 92 ms 604 KB Output is correct
50 Correct 144 ms 636 KB Output is correct
51 Correct 54 ms 604 KB Output is correct
52 Correct 69 ms 604 KB Output is correct
53 Correct 109 ms 604 KB Output is correct
54 Correct 135 ms 600 KB Output is correct
55 Runtime error 1 ms 604 KB Execution killed with signal 11
56 Halted 0 ms 0 KB -