oj.uz

답안 #123036

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
123036 2019-06-30T05:19:08 Z SirCeness Simurgh (IOI17_simurgh) C++14
0 / 100
 478 ms 12248 KB 
#include <bits/stdc++.h>
#include "simurgh.h"

#define pb push_back
#define mp make_pair
#define inside sl<=l&&r<=sr
#define outside r<sl||sr<l
using namespace std;
typedef long long ll;

int n, m;
bitset<500> vis;
vector<int> tree;
list<int> adj[505];
map<pair<int, int>, int> mpp;

int get(int node1, int node2){
	//cout << "get(" << node1 << ", " << node2 << ")" << endl;
	if (mpp.count(mp(node2, node1)) == 0){
		return mpp[mp(node1, node2)];
	} else return mpp[mp(node2, node1)];
}

void findtree(int node, int ata){
	//cout << "findtree(" << node << ", " << ata << ")" <<endl;
	if (vis[node] == 1) return;
	vis[node] = 1;
	if (ata != -1){
		tree.pb(get(node, ata));
	}
	for (list<int>::iterator it = adj[node].begin(); it != adj[node].end(); ++it){
		findtree(*it, node);
	}
}

vector<int> find_roads(int N, vector<int> u, vector<int> v) {
	n = N;
	set<int> ans;
	for (int i = 0; i < u.size(); i++){
		adj[u[i]].pb(v[i]);
		adj[v[i]].pb(u[i]);
		mpp[mp(u[i], v[i])] = i;
	}
	for (int i = 0; i < n-1; i++){
		vis.reset();
		vis[i] = 1;
		tree.clear();
		findtree(i+1, -1);
		//cout << "tree bitti" << endl;
		vector<pair<int, int> > vals;
		int maxx = 0;
		tree.pb(0);
		for (list<int>::iterator it = adj[i].begin(); it != adj[i].end(); ++it){
			tree[n-2] = get(i, *it);
			int val = count_common_roads(tree);
			maxx = max(maxx, val);
			vals.pb(mp(val, *it));
		}
		
		for (int j = 0; j < vals.size(); j++){
			if (vals[j].first == maxx) ans.insert(get(i, vals[j].second));
		}
	}
	vector<int> ansv;
	for (set<int>::iterator it = ans.begin(); it != ans.end(); ++it){
		ansv.pb(*it);
	}
	return ansv;
}

Compilation message

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:39:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < u.size(); i++){
                  ~~^~~~~~~~~~
simurgh.cpp:60:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < vals.size(); j++){
                   ~~^~~~~~~~~~~~~

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 252 KB correct
2 Correct 2 ms 376 KB correct
3 Correct 2 ms 376 KB correct
4 Correct 2 ms 376 KB correct
5 Correct 2 ms 376 KB correct
6 Correct 2 ms 252 KB correct
7 Correct 2 ms 376 KB correct
8 Correct 2 ms 420 KB correct
9 Incorrect 2 ms 376 KB WA in grader: NO
10 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 252 KB correct
2 Correct 2 ms 376 KB correct
3 Correct 2 ms 376 KB correct
4 Correct 2 ms 376 KB correct
5 Correct 2 ms 376 KB correct
6 Correct 2 ms 252 KB correct
7 Correct 2 ms 376 KB correct
8 Correct 2 ms 420 KB correct
9 Incorrect 2 ms 376 KB WA in grader: NO
10 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 252 KB correct
2 Correct 2 ms 376 KB correct
3 Correct 2 ms 376 KB correct
4 Correct 2 ms 376 KB correct
5 Correct 2 ms 376 KB correct
6 Correct 2 ms 252 KB correct
7 Correct 2 ms 376 KB correct
8 Correct 2 ms 420 KB correct
9 Incorrect 2 ms 376 KB WA in grader: NO
10 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 252 KB correct
2 Correct 2 ms 376 KB correct
3 Correct 2 ms 376 KB correct
4 Correct 2 ms 376 KB correct
5 Correct 2 ms 376 KB correct
6 Correct 2 ms 252 KB correct
7 Correct 2 ms 376 KB correct
8 Correct 2 ms 420 KB correct
9 Incorrect 2 ms 376 KB WA in grader: NO
10 Halted 0 ms 0 KB -