oj.uz

Submission #930859

# Submission time Handle Problem Language Result Execution time Memory
930859 2024-02-20T14:02:25 Z vjudge1 Party (POI11_imp) C++17
9 / 100
 818 ms 62200 KB 
#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;
    }
}

Compilation message

imp.cpp:16:11: warning: overflow in conversion from 'long long int' to 'int' changes value from '9223372036854775807' to '-1' [-Woverflow]
   16 | int INF = LLONG_MAX;
      |           ^~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4696 KB Output is correct
2 Incorrect 12 ms 6492 KB Wypisano za ma³o osób
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6492 KB Output is correct
2 Incorrect 43 ms 12892 KB Wypisano za ma³o osób
3 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8540 KB Output is correct
2 Incorrect 109 ms 19092 KB Wypisano za ma³o osób
3 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 12912 KB Wypisano za ma³o osób
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 89 ms 19032 KB Wypisano za ma³o osób
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 25176 KB Output is correct
2 Incorrect 452 ms 29448 KB Wypisano za ma³o osób
3 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 382 ms 29272 KB Output is correct
2 Incorrect 511 ms 31496 KB Wypisano za ma³o osób
3 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 498 ms 31324 KB Wypisano za ma³o osób
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 611 ms 55416 KB Output is correct
2 Incorrect 799 ms 60240 KB Wypisano za ma³o osób
3 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 752 ms 62200 KB Output is correct
2 Incorrect 818 ms 58348 KB Wypisano za ma³o osób
3 Halted 0 ms 0 KB -