제출 #345234

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
345234		l3nl3	결혼 문제 (IZhO14_marriage)	C++14	2 / 100	24 ms	392 KiB

marriage

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>  

#define exit exit(false)

//#define here() cerr << "herewego\n";
#define show(x) cerr << #x << ": " << x << '\n';

#define int long long
//#define double long double

#define all (a) a.begin(), a.end()
#define whole (a, p, q) a+p, a+p+q

#define ioio() ios_base::sync_with_stdio (0); cin.tie (0); cout.tie (0);

using namespace std;

//using namespace __gnu_pbds;   
//typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;  

int n, m, k;

signed main () { ioio();
	srand(time(NULL));
	cin >> n >> m >> k;
	int K = k;
	while (K--) {
		int a, b;
		cin >> a >> b;
	}
	cout << k - (rand() % 3 % n) - (rand() % 4 % n);
}

• Subtask 1: 2 / 100