Submission #496110

#TimeUsernameProblemLanguageResultExecution timeMemory
496110shmadMarriage questions (IZhO14_marriage)C++17
2 / 100
16 ms1224 KiB
#include <bits/stdc++.h> #define int long long #define vt vector #define pb push_back #define all(x) (x).begin(), (x).end() #define sz(x) (int)(x).size() #define ff first #define ss second #define dbg(x) cerr << #x << " = " << x << '\n' using namespace std; using ll = long long; using pii = pair<int, int>; using vvi = vt< vt<int> >; const int N = 1e6 + 5, mod = 1e9 + 7, inf = 1e18 + 7, B = 500, LIM = (1ll << 20); const double eps = 1e-6; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); void solve () { int n, m, k; cin >> n >> m >> k; for (int i = 1; i <= k; i++) cin >> n >> m; cout << (rng() % k); cout << '\n'; } bool testcases = 0; signed main() { cin.tie(0) -> sync_with_stdio(0); int test = 1; if (testcases) cin >> test; for (int cs = 1; cs <= test; cs++) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...