Submission #930853

#	Time	Username	Problem	Language	Result	Execution time	Memory
930853		vjudge1	무제 (POI11_imp)	C++17	9 / 100	729 ms	65536 KiB

Main

#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define pii pair<int,int>
#define vint vector<int>
#define vpii vector<pii>
#define pb push_back
#define se second
#define fi first
#define all(x) x.begin(), x.end()
#define graph vector<vint>
using namespace std;
const int N = (int)3000 + 69;
const int mod = 9999991;
const int naser = 3999, has_7 = 3662;
int INF = LLONG_MAX;
int power(int a, int bb) { int ans = 1;while (bb) { if (bb % 2) { ans *= a; }a *= a;bb /= 2; }return ans; }
int gcd(int a, int b) { if (b == 0)return a;return gcd(b, a % b); }


int edge[N][N];
int32_t main() {

    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m;
    cin >> n >> m;
    set<int> ans;
    for (int i = 1; i <= n; i++)
        ans.insert(i);
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        edge[u][v] = 1;
        edge[v][u] = 1;
    }
    for (int i = 1; i <= n; i++) {
        if (ans.count(i))
            for (int j = i + 1; j <= n; j++) {
                if (!edge[i][j] && ans.count(j)) {
                    ans.erase(i);
                    ans.erase(j);
                }
            }
    }
    int cnt = 0;
    for (int i : ans) {
        cout << i << ' ';
        if (++cnt == n / 3)
            break;
    }
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 10