oj.uz

Submission #991517

# Submission time Handle Problem Language Result Execution time Memory
991517 2024-06-02T10:58:51 Z Muaath_5 Magic Show (APIO24_show) C++17
5 / 100
 2 ms 832 KB 
#include <bits/stdc++.h>
using namespace std;
#ifndef MUAATH_5
#include "Alice.h"
#endif

#ifdef MUAATH_5 
const int X_LIM = 5000;

int n__;
long long setN(int n) {
	n__ = n;
	return 231; // rand
}
#endif

// you may define some global variables, but it does not work if you try to transfer any information from function Alice() to function Bob() through these variables.
// you had better not use the same global variables in function Alice() and in function Bob().

std::vector<std::pair<int,int>> Alice(){
	// add your code here
	vector<pair<int,int>> sol;
	// change below into your code
	const int n = 5000;
    long long x = setN(n);
    for (int i = 1; i <= n; i++) {
    	if (x != i)
	    	sol.push_back({x, i});
    }
    return sol;
}

#ifdef MUAATH_5
int main()
{		
	const int t = 1;
	cout << t << '\n';
	for (int _ = 0; _ < t; _++) {
		auto res = Alice();
		cout << res.size() << '\n';
		for (auto [u, v] : res) {
			cout << u << ' ' << v << '\n';
		}
		assert(int(res.size()) == n__-1);	
	}
}
#endif
#include <bits/stdc++.h>
using namespace std;
#ifndef MUAATH_5
#include "Bob.h"
#endif



// you may define some global variables, but it does not work if you try to transfer any information from function Alice() to function Bob() through these variables.
// you had better not use the same global variables in function Alice() and in function Bob().

int freq[5001];

long long Bob(std::vector<std::pair<int,int>> V){
	memset(freq, 0, sizeof freq);
	for (auto [u, v] : V)
		freq[u]++, freq[v]++;
	int mx = max_element(freq, freq+5001)-freq;
	return mx;
}

#ifdef MUAATH_5
int main()
{
	int m;
	cin >> m;
	vector<pair<int, int>> vv(m);
	for (int i = 0; i < m; i++) {
		int u, v;
		cin >> u >> v;
		if (u > v) swap(u, v);
		vv[i] = {u, v};
	}
	sort(vv.begin(), vv.end());
	cout << Bob(vv);
}
#endif

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 820 KB Correct.
2 Correct 1 ms 820 KB Correct.
3 Correct 1 ms 832 KB Correct.
4 Correct 1 ms 824 KB Correct.
5 Correct 2 ms 820 KB Correct.
6 Correct 1 ms 820 KB Correct.
7 Correct 2 ms 828 KB Correct.
8 Correct 2 ms 820 KB Correct.
9 Correct 2 ms 820 KB Correct.
10 Correct 2 ms 832 KB Correct.
11 Correct 2 ms 832 KB Correct.
12 Correct 2 ms 812 KB Correct.

Subtask #2
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 820 KB Correct.
2 Correct 1 ms 820 KB Correct.
3 Correct 1 ms 832 KB Correct.
4 Correct 1 ms 824 KB Correct.
5 Correct 2 ms 820 KB Correct.
6 Correct 1 ms 820 KB Correct.
7 Correct 2 ms 828 KB Correct.
8 Correct 2 ms 820 KB Correct.
9 Correct 2 ms 820 KB Correct.
10 Correct 2 ms 832 KB Correct.
11 Correct 2 ms 832 KB Correct.
12 Correct 2 ms 812 KB Correct.
13 Incorrect 0 ms 344 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 820 KB Correct.
2 Correct 1 ms 820 KB Correct.
3 Correct 1 ms 832 KB Correct.
4 Correct 1 ms 824 KB Correct.
5 Correct 2 ms 820 KB Correct.
6 Correct 1 ms 820 KB Correct.
7 Correct 2 ms 828 KB Correct.
8 Correct 2 ms 820 KB Correct.
9 Correct 2 ms 820 KB Correct.
10 Correct 2 ms 832 KB Correct.
11 Correct 2 ms 832 KB Correct.
12 Correct 2 ms 812 KB Correct.
13 Incorrect 0 ms 344 KB Output isn't correct
14 Halted 0 ms 0 KB -