oj.uz

답안 #872183

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
872183 2023-11-12T13:04:24 Z Matjaz 낙하산 고리들 (IOI12_rings) C++14
0 / 100
 4000 ms 40144 KB 

#include <vector>
#include <queue>

using namespace std;


int N;
vector<vector<int> > s;

void Init(int N_) {
    N = N_;
    s.assign(N, vector <int> ());
}

void Link(int A, int B) {
    s[A].push_back(B);
    s[B].push_back(A);

}

int CountCritical() {
    int res = 0;
    
    for (int t=0;t<N;t++){
        vector<int> d(N);
        for (int i=0;i<N;i++) d[i] = s[i].size();
        for (int i=0;i<s[t].size();i++) d[s[t][i]]--;
        
        vector<int> found(N, 0);
        bool critical = true;
        for (int i=0;i<N;i++){
            if (i == t) continue;
            found[i] = true;
            
            if (d[i] == 0) continue;
            
            int countOne = 0;
            
            queue<int> Q;
            Q.push(i);
            
            while (!Q.empty()){
                int x = Q.front();Q.pop();
                if (d[x] > 2){
                    critical = false;
                    break;
                }
                if (d[x] == 1) countOne++;
                for (int i=0;i<s[x].size();i++){
                    if (found[s[x][i]]) continue;
                    found[s[x][i]] = true;
                    Q.push(s[x][i]);
                    
                }
            }
            if (countOne != 2) critical = false;
        }
        
        if (critical) res++;
    }
    
    return res;
}

Compilation message

rings.cpp: In function 'int CountCritical()':
rings.cpp:29:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |         for (int i=0;i<s[t].size();i++) d[s[t][i]]--;
      |                      ~^~~~~~~~~~~~
rings.cpp:51:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |                 for (int i=0;i<s[x].size();i++){
      |                              ~^~~~~~~~~~~~

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

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

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -