oj.uz

답안 #1116101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1116101 2024-11-21T09:05:49 Z vjudge1 Pipes (CEOI15_pipes) C++17
30 / 100
 2133 ms 35788 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back

const int lim=1e5+1;

int parent[lim];
int find(int i){
  if(i==parent[i])return i;
  return parent[i]=find(parent[i]);
}
void unite(int i,int j){
  i=find(i),j=find(j);
  parent[i]=j;
}

struct vec{
  int*targ=new int[5],size=5,have=0;
  void pb(int t){
    if(have==size){
      int*newy=new int[size*2];
      for(int i=0;i<size;i++)newy[i]=targ[i];
      size*=2;
      delete targ;
      targ=newy;
    }
    targ[have++]=t;
  }
  void clear(){
    have=0;
    size=5;
    delete targ;
    targ=new int[5];
  }
};

vec v[lim];
vector<pair<int,int>>edges;

int tin[lim],tout[lim],tt=1;

int dfs(int node,int par){
  if(tout[node])return tout[node];
  tout[node]=tin[node]=tt++;
  for(int i=0;i<v[node].have;i++){
    int j=v[node].targ[i];
    if(j==par)continue;
    int res=dfs(j,node);
    if(res<=tin[node]){
      unite(node,j);
    }
    tout[node]=min(tout[node],res);
  }
  return tout[node];
}

int n,m;
void findans(){
  for(int i=0;i<=n;i++)v[i].clear();
  for(auto[x,y]:edges){
    v[find(x)].pb(find(y));
    v[find(y)].pb(find(x));
  }
  for(int i=1;i<=n;i++){
    tout[i]=tin[i]=0;
  }
  tt=1;
  for(int i=1;i<=n;i++){
    if(!tout[i])dfs(i,0);
  }
  for(int i=0;i<edges.size();i++){
    if(find(edges[i].first)==find(edges[i].second)){
      swap(edges[i],edges.back());
      edges.pop_back();
      i--;
    }
  }
}

int main(){
  cin>>n>>m;
  for(int i=1;i<=n;i++)parent[i]=i;
  for(int i=0;i<m;i++){
    int x,y;
    cin>>x>>y;
    if(find(x)!=find(y))edges.pb({x,y});
    if(edges.size()==200000)findans();
  }
  findans();
  for(auto[x,y]:edges)cout<<x<<' '<<y<<'\n';
}

Compilation message

pipes.cpp: In function 'void findans()':
pipes.cpp:71:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |   for(int i=0;i<edges.size();i++){
      |               ~^~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5712 KB Output is correct
2 Incorrect 5 ms 5668 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 6220 KB Output is correct
2 Incorrect 9 ms 5968 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 181 ms 10444 KB Output is correct
2 Correct 175 ms 9932 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 295 ms 11196 KB Output is correct
2 Correct 342 ms 10432 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 502 ms 11732 KB Output is correct
2 Correct 404 ms 11240 KB Output is correct

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1660 ms 22484 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2133 ms 35788 KB Memory limit exceeded
2 Halted 0 ms 0 KB -