# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
131827 | SirCeness | Naan (JOI19_naan) | C++14 | 919 ms | 125896 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>
using namespace std;
#define mod 998244353
#define mp make_pair
#define pb push_back
#define bas(x) #x << ": " << x << " "
#define prarr(x, n) cout << #x << ": "; for (int qsd = 0; qsd < n; qsd++) cout << x[qsd] << " "; cout << endl;
#define prarrv(x) cout << #x << ": "; for (int qsd = 0; qsd < (int)x.size(); qsd++) cout << x[qsd] << " "; cout << endl;
#define inside sl<=l%&&r<=sr
#define outside sr<l||r<sl
typedef long long ll;
int n, m;
ll mat[2002][2002];
ll presum[2002][2002];
pair<ll, ll> bol[2002][2002];
vector<pair<ll, ll> > ans;
vector<int> p;
pair<ll, ll> sum(pair<ll, ll> a, pair<ll, ll> b){
ll pay = a.first*b.second + a.second*b.first;
ll payda = a.second*b.second;
return mp(pay, payda);
}
pair<ll, ll> get(int i, ll pay, ll payda){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |