oj.uz

Submission #930827

# Submission time Handle Problem Language Result Execution time Memory
930827 2024-02-20T13:21:37 Z vjudge1 Party (POI11_imp) C++17
0 / 100
 614 ms 65536 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 = 1; j <= n; j++) {
                    if (!edge[i][j] && ans.count(j)) {
                        ans.erase(i);
                        ans.erase(j);
                    }
                }
        }
        while (ans.size() > n / 3) {
            ans.erase(*ans.rbegin());
        }
        for (int i : ans)
            cout << i << ' ';
    
     
}

Compilation message

imp.cpp: In function 'int32_t main()':
imp.cpp:46:27: warning: comparison of integer expressions of different signedness: 'std::set<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   46 |         while (ans.size() > n / 3) {
      |                ~~~~~~~~~~~^~~~~~~

Subtask #1
0 / 9.0

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

Subtask #2
0 / 9.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 9.0

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

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 23132 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 163 ms 37468 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 Incorrect 370 ms 49756 KB Wypisano za ma³o osób
2 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

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

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 614 ms 62044 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 Runtime error 20 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 16 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -