oj.uz

답안 #46954

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
46954 2018-04-25T10:58:37 Z iletavcioski Pipes (CEOI15_pipes) C++17
0 / 100
 597 ms 65536 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n,m;
vector<int> rednibr;
vector<int> artocki;
vector<vector<int> > v;
int broj=0;
int dfs(int x,int pr,int broj)
{
    int minbr=broj;
    int granki=0;
    int t;
    int maxi=0;
    rednibr[x]=broj;
    for(int i=0;i<v[x].size();i++)
    {
        if(v[x][i]==pr)
            continue;
        if(rednibr[v[x][i]])
            minbr=min(minbr,rednibr[v[x][i]]);
        else
        {
            int t=dfs(v[x][i],x,broj+1);
            minbr=min(minbr,t);
            maxi=max(maxi,t);
            granki++;
        }
    }
    if(x==0)
    {
        if(granki>1)
            artocki.push_back(x);
    }
    else
    {
        if(maxi>=rednibr[x])
            artocki.push_back(x);
    }
    return minbr;
}
int main()
{
    cin>>n;
    cin>>m;
    vector<int> vec;
    vector<int> s,e;
    v.insert(v.begin(),2*(n+m+4),vec);
    int nov=m;
    rednibr.insert(rednibr.begin(),2*(n+m+4),0);
    for(int i=0;i<m;i++)
    {
        int a,b;
        cin>>a>>b;
        a--;
        b--;
        s.push_back(a);
        e.push_back(b);
        v[a].push_back(nov);
        v[b].push_back(nov);
        v[nov].push_back(a);
        v[nov].push_back(b);
        nov++;
    }
    dfs(0,-1,1);
    sort(artocki.begin(),artocki.end());
    for(int i=0;i<artocki.size();i++)
    { 
        cout<<-1<<endl;
    }
    cout<<endl;
    return 0;
}
/*
9 11
1 2
2 3
3 1
3 4
4 5
5 6
6 4
6 7
7 8
8 9
9 7
*/

Compilation message

pipes.cpp: In function 'int dfs(int, int, int)':
pipes.cpp:17:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~
pipes.cpp:14:9: warning: unused variable 't' [-Wunused-variable]
     int t;
         ^
pipes.cpp: In function 'int main()':
pipes.cpp:68:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<artocki.size();i++)
                 ~^~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Wrong number of edges
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 13 ms 2432 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 597 ms 64796 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 189 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 56 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 60 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 60 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 56 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 61 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 61 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -