oj.uz

답안 #288492

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
288492 2020-09-01T14:23:37 Z davi_bart Simurgh (IOI17_simurgh) C++14
30 / 100
 968 ms 10536 KB 
#include "simurgh.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define ld long double
/*
4 6
0 1
0 2
0 3
1 2
1 3
2 3
0 1 5
*/
int count_common_roads(const vector<int>& r);
int ask(set<int> o){
  vector<int> x;
  for(int y:o)x.push_back(y);
  return count_common_roads(x);
}
int N;
set<pair<int,int> > p[600];
vector<int> grafo(int pos){
  vector<int> group(N+2,-1);
  set<int> v;
  vector<bool> vis(N+2,0);

  queue<pair<int,int> >q;

  for(int i=0;i<N;i++){
    if(vis[i] || i==pos)continue;
    q.push({i,-1});
    while(!q.empty()){
      auto &[pp,idx]=q.front();
      q.pop();
      if(vis[pp])continue;
      vis[pp]=1;
      group[pp]=i;
      if(idx!=-1)v.insert(idx);
      for(auto x:p[pp]){
        if(x.first!=pos)q.push({x.first,x.second});
      }
    }
  }

  vector<int> arc[N+2];
  for(auto &[a,b]:p[pos]){
    arc[group[a]].push_back(b);
  }

  vector<int> prendere;

  for(int i=0;i<N;i++){
    if(arc[i].size()==0)continue;
    v.insert(arc[i][0]);
  }
  for(int i=0;i<N;i++){
    if(arc[i].size()==0)continue;
    if(arc[i].size()==1){
      prendere.push_back(arc[i][0]);
      continue;
    }
    int ma=ask(v);
    vector<int> qq={ma};
    for(int j=1;j<arc[i].size();j++){
      v.erase(arc[i][j-1]);
      v.insert(arc[i][j]);
      qq.push_back(ask(v));
      ma=max(ma,qq.back());
    }
    for(int j=0;j<arc[i].size();j++){
      if(qq[j]==ma){
        prendere.push_back(arc[i][j]);
      }
    }
  }
  return prendere;
}

std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v){
  N=n;
  for(int i=0;i<u.size();i++){
    p[u[i]].insert({v[i],i});
    p[v[i]].insert({u[i],i});
  }
  vector<int> ans;
	for(int i=0;i<N;i++){
    auto x=grafo(i);
    for(int j:x)ans.push_back(j);
    sort(ans.begin(),ans.end());
    ans.resize(unique(ans.begin(),ans.end())-ans.begin());
    if(ans.size()==N-1)break;
	}
	return ans;
}

Compilation message

simurgh.cpp: In function 'std::vector<int> grafo(int)':
simurgh.cpp:37:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   37 |       auto &[pp,idx]=q.front();
      |             ^
simurgh.cpp:50:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   50 |   for(auto &[a,b]:p[pos]){
      |             ^
simurgh.cpp:68:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |     for(int j=1;j<arc[i].size();j++){
      |                 ~^~~~~~~~~~~~~~
simurgh.cpp:74:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     for(int j=0;j<arc[i].size();j++){
      |                 ~^~~~~~~~~~~~~~
simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:85:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |   for(int i=0;i<u.size();i++){
      |               ~^~~~~~~~~
simurgh.cpp:95:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   95 |     if(ans.size()==N-1)break;
      |        ~~~~~~~~~~^~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB correct
2 Correct 1 ms 384 KB correct
3 Incorrect 956 ms 10536 KB WA in grader: NO
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

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