제출 #1274854

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1274854		icebear	Joker (BOI20_joker)	C++20	0 / 100	2095 ms	3632 KiB

Joker

// ~~ icebear ~~
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

template<class T>
    bool minimize(T &a, const T &b) {
        if (a > b) return a = b, true;
        return false;
    }

template<class T>
    bool maximize(T &a, const T &b) {
        if (a < b) return a = b, true;
        return false;
    }

#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RED(i, n) for(int i=(n)-1; i>=0; --i)
#define MASK(i) (1LL << (i))
#define BIT(S, i) (((S) >> (i)) & 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "icebear"

const int MOD = 1e9 + 7;
const int inf = 1e9 + 27092008;
const ll INF = 1e18 + 27092008;
const int N = 2e5 + 5;
int numNode, numEdge, numQuery, ans[N];
ii edge[N];

struct DisjointSet {
    vector<int> lab;
    bool biparite;
    DisjointSet(int n = 0): lab(n + 5, -1), biparite(true) {}

    int root(int v) {
        return (lab[v] < 0 ? v : lab[v] = root(lab[v]));
    }

    bool unite(int u, int v) {
        u = root(u);
        v = root(v);
        if (u == v) return false;
        if (lab[u] > lab[v]) swap(u, v);
        lab[u] += lab[v];
        lab[v] = u;
        return true;
    }

    void add_edge(int u, int v) {
        unite(u, v + numNode);
        unite(v, u + numNode);
        if (root(u) == root(u + numNode)) biparite = false;
        if (root(v) == root(v + numNode)) biparite = false;
    }
} dsu;

void init(void) {
    cin >> numNode >> numEdge >> numQuery;
    FOR(i, 1, numEdge) cin >> edge[i].fi >> edge[i].se;
}

void process(void) {
    FOR(i, 1, numEdge) {
        if (ans[i - 1] == numEdge + 1) {
            ans[i] = numEdge + 1;
            continue;
        }
        dsu = DisjointSet(2 * numNode);
        FOR(j, 1, i) dsu.add_edge(edge[j].fi, edge[j].se);
        if (dsu.biparite == false) ans[i] = numEdge + 1;
        else {
            FORR(j, numEdge, i + 1) {
                dsu.add_edge(edge[j].fi, edge[j].se);
                if (dsu.biparite == false) {
                    ans[i] = j;
                    break;
                }
            }
        }
    }

    while(numQuery--) {
        int l, r;
        cin >> l >> r;
        cout << (ans[l - 1] > r ? "YES\n" : "NO\n");
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int tc = 1;
//    cin >> tc;
    while(tc--) {
        init();
        process();
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

Joker.cpp: In function 'int main()':
Joker.cpp:104:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  104 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Joker.cpp:105:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  105 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 25
• Subtask 3: 0 / 10
• Subtask 4: 0 / 22
• Subtask 5: 0 / 29
• Subtask 6: 0 / 6