oj.uz

Submission #1075803

# Submission time Handle Problem Language Result Execution time Memory
1075803 2024-08-26T09:14:37 Z edogawa_something Simurgh (IOI17_simurgh) C++17
30 / 100
 80 ms 23104 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);
        vis[i]=1;
        ans.pop_back();
      }
    }
    /*if(s.size()==1) {
      bool chk=1;
      for(auto itt:res) {
        if(!d.same(u[itt],vv[itt]))
          chk=0;
      }
      if(chk) {
        for(auto it:v)
          res.pb(it);
      }
    }
    else {*/
      for(auto it:v) {
        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;
}

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:103:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |   for(int i=0;i<u.size();i++)
      |               ~^~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from simurgh.cpp:2:
simurgh.cpp:105:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  105 |   assert(res.size()==n-1);
      |          ~~~~~~~~~~^~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6232 KB correct
2 Correct 2 ms 6236 KB correct
3 Correct 2 ms 6320 KB correct
4 Correct 2 ms 6236 KB correct
5 Correct 3 ms 6236 KB correct
6 Correct 2 ms 6136 KB correct
7 Correct 3 ms 6236 KB correct
8 Correct 2 ms 6320 KB correct
9 Correct 2 ms 6232 KB correct
10 Correct 2 ms 6236 KB correct
11 Correct 3 ms 6232 KB correct
12 Correct 3 ms 6236 KB correct
13 Correct 3 ms 6236 KB correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6232 KB correct
2 Correct 2 ms 6236 KB correct
3 Correct 2 ms 6320 KB correct
4 Correct 2 ms 6236 KB correct
5 Correct 3 ms 6236 KB correct
6 Correct 2 ms 6136 KB correct
7 Correct 3 ms 6236 KB correct
8 Correct 2 ms 6320 KB correct
9 Correct 2 ms 6232 KB correct
10 Correct 2 ms 6236 KB correct
11 Correct 3 ms 6232 KB correct
12 Correct 3 ms 6236 KB correct
13 Correct 3 ms 6236 KB correct
14 Correct 15 ms 6236 KB correct
15 Correct 14 ms 6452 KB correct
16 Correct 14 ms 6460 KB correct
17 Correct 12 ms 6232 KB correct
18 Correct 6 ms 6236 KB correct
19 Correct 12 ms 6236 KB correct
20 Correct 11 ms 6236 KB correct
21 Correct 11 ms 6444 KB correct
22 Correct 7 ms 6236 KB correct
23 Correct 6 ms 6192 KB correct
24 Correct 6 ms 6324 KB correct
25 Correct 3 ms 6236 KB correct
26 Correct 6 ms 6236 KB correct
27 Correct 7 ms 6392 KB correct
28 Correct 4 ms 6236 KB correct
29 Correct 3 ms 6316 KB correct
30 Correct 8 ms 6236 KB correct
31 Correct 8 ms 6360 KB correct
32 Correct 9 ms 6236 KB correct
33 Correct 9 ms 6396 KB correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6232 KB correct
2 Correct 2 ms 6236 KB correct
3 Correct 2 ms 6320 KB correct
4 Correct 2 ms 6236 KB correct
5 Correct 3 ms 6236 KB correct
6 Correct 2 ms 6136 KB correct
7 Correct 3 ms 6236 KB correct
8 Correct 2 ms 6320 KB correct
9 Correct 2 ms 6232 KB correct
10 Correct 2 ms 6236 KB correct
11 Correct 3 ms 6232 KB correct
12 Correct 3 ms 6236 KB correct
13 Correct 3 ms 6236 KB correct
14 Correct 15 ms 6236 KB correct
15 Correct 14 ms 6452 KB correct
16 Correct 14 ms 6460 KB correct
17 Correct 12 ms 6232 KB correct
18 Correct 6 ms 6236 KB correct
19 Correct 12 ms 6236 KB correct
20 Correct 11 ms 6236 KB correct
21 Correct 11 ms 6444 KB correct
22 Correct 7 ms 6236 KB correct
23 Correct 6 ms 6192 KB correct
24 Correct 6 ms 6324 KB correct
25 Correct 3 ms 6236 KB correct
26 Correct 6 ms 6236 KB correct
27 Correct 7 ms 6392 KB correct
28 Correct 4 ms 6236 KB correct
29 Correct 3 ms 6316 KB correct
30 Correct 8 ms 6236 KB correct
31 Correct 8 ms 6360 KB correct
32 Correct 9 ms 6236 KB correct
33 Correct 9 ms 6396 KB correct
34 Incorrect 80 ms 8280 KB WA in grader: NO
35 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6236 KB correct
2 Correct 2 ms 6236 KB correct
3 Runtime error 26 ms 23104 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6232 KB correct
2 Correct 2 ms 6236 KB correct
3 Correct 2 ms 6320 KB correct
4 Correct 2 ms 6236 KB correct
5 Correct 3 ms 6236 KB correct
6 Correct 2 ms 6136 KB correct
7 Correct 3 ms 6236 KB correct
8 Correct 2 ms 6320 KB correct
9 Correct 2 ms 6232 KB correct
10 Correct 2 ms 6236 KB correct
11 Correct 3 ms 6232 KB correct
12 Correct 3 ms 6236 KB correct
13 Correct 3 ms 6236 KB correct
14 Correct 15 ms 6236 KB correct
15 Correct 14 ms 6452 KB correct
16 Correct 14 ms 6460 KB correct
17 Correct 12 ms 6232 KB correct
18 Correct 6 ms 6236 KB correct
19 Correct 12 ms 6236 KB correct
20 Correct 11 ms 6236 KB correct
21 Correct 11 ms 6444 KB correct
22 Correct 7 ms 6236 KB correct
23 Correct 6 ms 6192 KB correct
24 Correct 6 ms 6324 KB correct
25 Correct 3 ms 6236 KB correct
26 Correct 6 ms 6236 KB correct
27 Correct 7 ms 6392 KB correct
28 Correct 4 ms 6236 KB correct
29 Correct 3 ms 6316 KB correct
30 Correct 8 ms 6236 KB correct
31 Correct 8 ms 6360 KB correct
32 Correct 9 ms 6236 KB correct
33 Correct 9 ms 6396 KB correct
34 Incorrect 80 ms 8280 KB WA in grader: NO
35 Halted 0 ms 0 KB -