oj.uz

답안 #574401

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
574401 2022-06-08T13:27:06 Z MohamedFaresNebili 낙하산 고리들 (IOI12_rings) C++14
20 / 100
 4000 ms 48892 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

        using namespace std;
        using namespace __gnu_pbds;

        using ll = long long;
        using ii = pair<ll, ll>;
        using vi = vector<int>;

        #define pb push_back
        #define pp pop_back
        #define ff first
        #define ss second
        #define lb lower_bound

        typedef tree<int, null_type, less<int>, rb_tree_tag,
            tree_order_statistics_node_update> indexed_set;

        const int oo = 1e18 + 7;

        int N; int vis[1000001];
        vector<int> adj[1000001];

        void Init(int n) { N = n; }
        void Link(int a, int b) {
            adj[a].pb(b), adj[b].pb(a);
        }
        bool dfs(int v, int p) {
            if(vis[v]) return 0;
            int children = 0; vis[v] = 1; bool ok = 1;
            for(auto u : adj[v]) {
                if(vis[u] == 2 || u == p) continue;
                children++; ok &= dfs(u, v);
            }
            if(v == p) return (ok && children <= 2);
            return (ok && children <= 1);
        }
        int CountCritical() {
            int res = 0;
            for(int l = 0; l < N; l++) {
                vis[l] = 2; bool ok = 1;
                for(int i = 0; i < N; i++) {
                    if(vis[i]) continue;
                    ok &= dfs(i, i);
                }
                res += ok; fill(vis, vis + N, 0);
            }
            return res;
        }

Compilation message

rings.cpp:20:29: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   20 |         const int oo = 1e18 + 7;
      |                        ~~~~~^~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 410 ms 24080 KB Output is correct
3 Correct 549 ms 24056 KB Output is correct
4 Correct 31 ms 23764 KB Output is correct
5 Correct 219 ms 23948 KB Output is correct
6 Correct 617 ms 24252 KB Output is correct
7 Correct 182 ms 23836 KB Output is correct
8 Correct 303 ms 24032 KB Output is correct
9 Correct 578 ms 24100 KB Output is correct
10 Correct 552 ms 24060 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4056 ms 48892 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 410 ms 24080 KB Output is correct
3 Correct 549 ms 24056 KB Output is correct
4 Correct 31 ms 23764 KB Output is correct
5 Correct 219 ms 23948 KB Output is correct
6 Correct 617 ms 24252 KB Output is correct
7 Correct 182 ms 23836 KB Output is correct
8 Correct 303 ms 24032 KB Output is correct
9 Correct 578 ms 24100 KB Output is correct
10 Correct 552 ms 24060 KB Output is correct
11 Execution timed out 4054 ms 24032 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 410 ms 24080 KB Output is correct
3 Correct 549 ms 24056 KB Output is correct
4 Correct 31 ms 23764 KB Output is correct
5 Correct 219 ms 23948 KB Output is correct
6 Correct 617 ms 24252 KB Output is correct
7 Correct 182 ms 23836 KB Output is correct
8 Correct 303 ms 24032 KB Output is correct
9 Correct 578 ms 24100 KB Output is correct
10 Correct 552 ms 24060 KB Output is correct
11 Execution timed out 4054 ms 24032 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 410 ms 24080 KB Output is correct
3 Correct 549 ms 24056 KB Output is correct
4 Correct 31 ms 23764 KB Output is correct
5 Correct 219 ms 23948 KB Output is correct
6 Correct 617 ms 24252 KB Output is correct
7 Correct 182 ms 23836 KB Output is correct
8 Correct 303 ms 24032 KB Output is correct
9 Correct 578 ms 24100 KB Output is correct
10 Correct 552 ms 24060 KB Output is correct
11 Execution timed out 4056 ms 48892 KB Time limit exceeded
12 Halted 0 ms 0 KB -