# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1008670 | detective_dots | Bank (IZhO14_bank) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
using namespace __gnu_pbds;
using namespace std;
#define sp << ' '
#define ll long long
#define ull unsigned long long
#define endl '\n'
#define MOD 1000000007ll
#define b_rev boost::adaptors::reverse
typedef vector<int> vi;
typedef vector<ll> vll;
typedef array<int, 2> ii;
typedef vector<array<int, 2>> vii;
#define vv(type) vector<vector<type>>
#define F first
#define S second
#define PB push_back
#define REP(i, a, b) for (int i = a; i < b; i++)
#define elif else if
#define nl <<'\n'
#define out(txt) {cout << txt << '\n'; return;}
template<class T> using ordered_set = tree<T, null_type, less<T>,
rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using multi_ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using min_queue = priority_queue<T, vector<T>, greater<>>;
// Pair addition