oj.uz

답안 #1075865

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1075865 2024-08-26T09:33:32 Z edogawa_something Simurgh (IOI17_simurgh) C++17
30 / 100
 81 ms 27216 KB 
#include "simurgh.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pb push_back
const ll M=250000;
vector<pii> adj[M];
bool vis[M];
vii sp;
void dfs(ll x) {
  vis[x]=1;
  for(auto it:adj[x]) {
    if(vis[it.F])
      continue;
    else {
      sp.pb(it.S);
      dfs(it.F);
    }
  }
}
struct dsu {
  ll sz[250],pa[250];
  void init(ll x) {
    for(int i=0;i<x;i++)
      sz[i]=1,pa[i]=i;
  }
  ll get(ll x) {
    if(x==pa[x])
      return x;
    return pa[x]=get(pa[x]);
  }
  void unite(ll x,ll y) {
    x=get(x),y=get(y);
    if(x==y)
      return;
    if(sz[x]>sz[y])
      swap(x,y);
    pa[x]=y;
    sz[y]+=sz[x];
  }
  bool same(ll x,ll y) {
    return get(x)==get(y);
  }
}d;
ll cnt[M],cc[M];
bool a[M];
set<ll>s;
vector<int> find_roads(int n, std::vector<int> u, std::vector<int> vv) {
  for(int i=0;i<u.size();i++)
    adj[u[i]].pb({vv[i],i}),adj[vv[i]].pb({u[i],i});
  dfs(0);
  vector<int>ans,res;
  for(int i=0;i<u.size();i++)
    vis[i]=0;
  ll cc=0;
  for(auto it:sp) {
    s.clear();
    ans.clear();
    d.init(n);
    vii v;
    for(auto itt:sp) {
      if(itt!=it)
        ans.pb(itt),d.unite(u[itt],vv[itt]);
    }
    for(int i=0;i<u.size();i++)
      cnt[i]=0;
    for(int i=0;i<u.size();i++) {
      if(!d.same(u[i],vv[i])) {
        ans.pb(i);
        ll x=count_common_roads(ans);
        cc++;
        cnt[ans.back()]=x;
        s.insert(x);
        v.pb(i);
        ans.pop_back();
      }
    }
    if(s.size()==1) {
      bool cc[2];
      cc[0]=cc[1]=0;
      for(int i=0;i<u.size();i++) {
        if(!d.same(u[i],vv[i])&&vis[i]&&!cc[a[i]]) {
          cc[a[i]]=1;
          ans.pb(i);
          s.insert(count_common_roads(ans));
          ans.pop_back();
        }
      }
    }
      for(auto it:v) {
        vis[it]=1;
        if(cnt[it]==*s.rbegin()) {
          a[it]=1;
        }
      }
  }
  for(int i=0;i<u.size();i++)
    if(a[i])res.pb(i);
  //assert(res.size()==n-1);
  //assert(cc<=30000);
  return res;
}
/*
5 10
0 1
0 2
0 3
0 4
1 2
1 3
1 4
2 3
2 4
3 4
3 6 8 9

*/

Compilation message

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:54:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |   for(int i=0;i<u.size();i++)
      |               ~^~~~~~~~~
simurgh.cpp:58:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |   for(int i=0;i<u.size();i++)
      |               ~^~~~~~~~~
simurgh.cpp:70:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |     for(int i=0;i<u.size();i++)
      |                 ~^~~~~~~~~
simurgh.cpp:72:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |     for(int i=0;i<u.size();i++) {
      |                 ~^~~~~~~~~
simurgh.cpp:86:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |       for(int i=0;i<u.size();i++) {
      |                   ~^~~~~~~~~
simurgh.cpp:102:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |   for(int i=0;i<u.size();i++)
      |               ~^~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10328 KB correct
2 Correct 2 ms 10332 KB correct
3 Correct 2 ms 10332 KB correct
4 Correct 2 ms 10332 KB correct
5 Correct 2 ms 10332 KB correct
6 Correct 2 ms 10332 KB correct
7 Correct 2 ms 10332 KB correct
8 Correct 2 ms 10332 KB correct
9 Correct 2 ms 10332 KB correct
10 Correct 2 ms 10332 KB correct
11 Correct 2 ms 10332 KB correct
12 Correct 2 ms 10544 KB correct
13 Correct 2 ms 10328 KB correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10328 KB correct
2 Correct 2 ms 10332 KB correct
3 Correct 2 ms 10332 KB correct
4 Correct 2 ms 10332 KB correct
5 Correct 2 ms 10332 KB correct
6 Correct 2 ms 10332 KB correct
7 Correct 2 ms 10332 KB correct
8 Correct 2 ms 10332 KB correct
9 Correct 2 ms 10332 KB correct
10 Correct 2 ms 10332 KB correct
11 Correct 2 ms 10332 KB correct
12 Correct 2 ms 10544 KB correct
13 Correct 2 ms 10328 KB correct
14 Correct 13 ms 10584 KB correct
15 Correct 13 ms 10588 KB correct
16 Correct 13 ms 10552 KB correct
17 Correct 11 ms 10588 KB correct
18 Correct 6 ms 10588 KB correct
19 Correct 11 ms 10588 KB correct
20 Correct 12 ms 10588 KB correct
21 Correct 11 ms 10588 KB correct
22 Correct 6 ms 10588 KB correct
23 Correct 6 ms 10584 KB correct
24 Correct 5 ms 10588 KB correct
25 Correct 3 ms 10332 KB correct
26 Correct 5 ms 10588 KB correct
27 Correct 6 ms 10588 KB correct
28 Correct 3 ms 10332 KB correct
29 Correct 2 ms 10332 KB correct
30 Correct 8 ms 10588 KB correct
31 Correct 9 ms 10608 KB correct
32 Correct 9 ms 10588 KB correct
33 Correct 7 ms 10588 KB correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10328 KB correct
2 Correct 2 ms 10332 KB correct
3 Correct 2 ms 10332 KB correct
4 Correct 2 ms 10332 KB correct
5 Correct 2 ms 10332 KB correct
6 Correct 2 ms 10332 KB correct
7 Correct 2 ms 10332 KB correct
8 Correct 2 ms 10332 KB correct
9 Correct 2 ms 10332 KB correct
10 Correct 2 ms 10332 KB correct
11 Correct 2 ms 10332 KB correct
12 Correct 2 ms 10544 KB correct
13 Correct 2 ms 10328 KB correct
14 Correct 13 ms 10584 KB correct
15 Correct 13 ms 10588 KB correct
16 Correct 13 ms 10552 KB correct
17 Correct 11 ms 10588 KB correct
18 Correct 6 ms 10588 KB correct
19 Correct 11 ms 10588 KB correct
20 Correct 12 ms 10588 KB correct
21 Correct 11 ms 10588 KB correct
22 Correct 6 ms 10588 KB correct
23 Correct 6 ms 10584 KB correct
24 Correct 5 ms 10588 KB correct
25 Correct 3 ms 10332 KB correct
26 Correct 5 ms 10588 KB correct
27 Correct 6 ms 10588 KB correct
28 Correct 3 ms 10332 KB correct
29 Correct 2 ms 10332 KB correct
30 Correct 8 ms 10588 KB correct
31 Correct 9 ms 10608 KB correct
32 Correct 9 ms 10588 KB correct
33 Correct 7 ms 10588 KB correct
34 Incorrect 81 ms 12364 KB WA in grader: NO
35 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10332 KB correct
2 Correct 2 ms 10332 KB correct
3 Runtime error 23 ms 27216 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10328 KB correct
2 Correct 2 ms 10332 KB correct
3 Correct 2 ms 10332 KB correct
4 Correct 2 ms 10332 KB correct
5 Correct 2 ms 10332 KB correct
6 Correct 2 ms 10332 KB correct
7 Correct 2 ms 10332 KB correct
8 Correct 2 ms 10332 KB correct
9 Correct 2 ms 10332 KB correct
10 Correct 2 ms 10332 KB correct
11 Correct 2 ms 10332 KB correct
12 Correct 2 ms 10544 KB correct
13 Correct 2 ms 10328 KB correct
14 Correct 13 ms 10584 KB correct
15 Correct 13 ms 10588 KB correct
16 Correct 13 ms 10552 KB correct
17 Correct 11 ms 10588 KB correct
18 Correct 6 ms 10588 KB correct
19 Correct 11 ms 10588 KB correct
20 Correct 12 ms 10588 KB correct
21 Correct 11 ms 10588 KB correct
22 Correct 6 ms 10588 KB correct
23 Correct 6 ms 10584 KB correct
24 Correct 5 ms 10588 KB correct
25 Correct 3 ms 10332 KB correct
26 Correct 5 ms 10588 KB correct
27 Correct 6 ms 10588 KB correct
28 Correct 3 ms 10332 KB correct
29 Correct 2 ms 10332 KB correct
30 Correct 8 ms 10588 KB correct
31 Correct 9 ms 10608 KB correct
32 Correct 9 ms 10588 KB correct
33 Correct 7 ms 10588 KB correct
34 Incorrect 81 ms 12364 KB WA in grader: NO
35 Halted 0 ms 0 KB -