oj.uz

답안 #293028

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
293028 2020-09-07T15:39:18 Z 임성재(#5807) 서류 전달 (ROI16_sending) C++17
0 / 100
 111 ms 10060 KB 
#include<bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define em emplace 
#define eb emplace_back
#define mp make_pair
#define all(v) (v).begin(), (v).end()

typedef unsigned int ui;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int inf = 1e9;
const ll INF = 1e18;

int n, q;
int p[100010];
int d[100010];
vector<int> g[100010];
ui v[40000010];
int cnt = 0;

int main() {
	fast;

	cin >> n >> q;

	for(int i=2; i<=n; i++) {
		cin >> p[i];
		d[i] = d[p[i]] + 1;
	}

	for(int i=1; i<=q; i++) {
		int u, v;
		cin >> u >> v;

		while(u != v) {
			if(d[u] > d[v]) swap(u, v);
			g[v].eb(i);
			v = p[v];
		}
	}

	for(int i=2; i<=n; i++) {
		sort(all(g[i]));

		for(int j=0; j<g[i].size(); j++) {
			for(int k=j+1; k<g[i].size(); k++) {
				//v[cnt++] = g[i][j] + (ui) q * g[i][k];
			}
		}
	}

	sort(v, v + cnt);

	int ans = 0;
	ui mxi = 1 + 2 * q;
	
	for(int i=0; i<cnt; ) {
		int j = i;
		while(j < cnt && v[i] == v[j]) j++;

		if(j - i > ans) {
			ans = j - i;
			mxi = v[i];
		}

		i = j;
	}
	
	cout << ans << "\n";
	cout << (mxi-1) % q + 1 << " " << (mxi-1) / q;
}

Compilation message

sending.cpp: In function 'int main()':
sending.cpp:50:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |   for(int j=0; j<g[i].size(); j++) {
      |                ~^~~~~~~~~~~~
sending.cpp:51:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |    for(int k=j+1; k<g[i].size(); k++) {
      |                   ~^~~~~~~~~~~~

Subtask #1
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2688 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2688 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2688 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2688 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 111 ms 10060 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 53 ms 6524 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2688 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2688 KB Output isn't correct
2 Halted 0 ms 0 KB -