oj.uz

답안 #60628

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
60628 2018-07-24T11:59:02 Z Tenuun Simurgh (IOI17_simurgh) C++17
0 / 100
 3 ms 924 KB 
#include "simurgh.h"
#include <bits/stdc++.h>
 
using namespace std;
 
vector<pair<int, int> >adj[501];
vector<int>t;
bool vis[501], check[125000]={false};
 
void DFS(int u, int p){
	vis[u]=true;
	for(auto v:adj[u]){
		if(v.first!=p && vis[v.first]==false){
			vis[v.first]=true;
			if(p!=-1) t.push_back(v.second);
			DFS(v.first, u);
		}
	}
}
 
int calc(int u){
	int mx=-1, p=-1, tmp;
	for(auto v:adj[u]){
		if(check[v.second]){
			t.push_back(v.second);
			mx=count_common_roads(t);
			t.pop_back();
			break;
		}
	}
	for(auto v:adj[u]){
		if(check[v.second])continue;
		t.push_back(v.second);
		tmp=count_common_roads(t);
		if(mx==-1){
			mx=tmp;
			p=v.second;
		}
		else if(tmp==mx){
			p=v.second;
		}
		t.pop_back();
	}
	return p;
}
 
vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
	int f, ind=0;
	memset(check, false, sizeof check);
	vector<int> res(n - 1);
	for(int i=0; i<u.size(); i++){
		adj[u[i]].push_back({v[i], i});
		adj[v[i]].push_back({u[i], i});
	}
	for(int i=0; i<n; i++){
		memset(vis, false, sizeof vis);
		t.clear();
		DFS(i, -1);
		f=calc(i);
		if(f==-1) continue;
		check[f]=true;
		res[ind++]=f;
	}
	return res;
}

Compilation message

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

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 760 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 760 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 760 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 760 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -