oj.uz

Submission #1005487

# Submission time Handle Problem Language Result Execution time Memory
1005487 2024-06-22T13:45:16 Z vjudge1 Party (POI11_imp) C++17
45 / 100
 1375 ms 65536 KB 
//
//  main.cpp
//  IntensiveCamp 2 2024
//
//  Created by Ali AlSalman on 17/05/2024.
//
 
#include <bits/stdc++.h>
 
#define endl '\n'
 
using namespace std;

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    
    
    int n, m;
    cin>>n>>m;
    set<int> nodes; for (int i = 1; i <= n; i++) nodes.insert(i);
    set<pair<int, int>> edges;
    while (m--) {
        int a, b;
        cin>>a>>b;
        edges.insert({min(a, b), max(a, b)});
    }
    
    for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) {
        if (nodes.find(i) != nodes.end() && nodes.find(j) != nodes.end() &&
            edges.find({i, j}) == edges.end()) { nodes.erase(i); nodes.erase(j); }
    }
    
    int reqRes = n / 3;
    for (auto node = nodes.begin(); reqRes--; node++) cout<<*node<<" "; cout<<endl;
}

Compilation message

imp.cpp: In function 'int main()':
imp.cpp:34:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   34 |     for (auto node = nodes.begin(); reqRes--; node++) cout<<*node<<" "; cout<<endl;
      |     ^~~
imp.cpp:34:73: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   34 |     for (auto node = nodes.begin(); reqRes--; node++) cout<<*node<<" "; cout<<endl;
      |                                                                         ^~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 36 ms 4928 KB Output is correct
3 Correct 39 ms 4956 KB Output is correct
4 Correct 50 ms 4944 KB Output is correct
5 Correct 35 ms 4824 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2904 KB Output is correct
2 Correct 226 ms 18572 KB Output is correct
3 Correct 209 ms 18516 KB Output is correct
4 Correct 250 ms 18516 KB Output is correct
5 Correct 194 ms 18556 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 6228 KB Output is correct
2 Correct 711 ms 41220 KB Output is correct
3 Correct 724 ms 41296 KB Output is correct
4 Correct 657 ms 41336 KB Output is correct
5 Correct 729 ms 41412 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 13396 KB Output is correct
2 Correct 1235 ms 59420 KB Output is correct
3 Correct 1375 ms 59472 KB Output is correct
4 Correct 1179 ms 59260 KB Output is correct
5 Correct 1338 ms 59560 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 640 ms 37108 KB Output is correct
2 Runtime error 1083 ms 65536 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1316 ms 65364 KB Output is correct
2 Runtime error 1162 ms 65536 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

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

Subtask #9
0 / 9.0

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

Subtask #10
0 / 9.0

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