# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
944174 | Tsagana | Group Photo (JOI21_ho_t3) | C++14 | 799 ms | 392652 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>
#define IOS ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define all(x) x.begin(), x.end()
#define int long long
#define pq priority_queue
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define mset multiset
#define F first
#define S second
using namespace std;
int n;
vector<vector<int > > dp(5001, vector<int >(5001, 0));
vector<vector<int > > psum(5001, vector<int >(5001, 0));
int inv(int up, int val, int p)
{
int cnt = 0;
cnt += psum[up][p] - psum[val - 1][p];
cnt += psum[val - 1][n] - psum[val - 1][p];
return cnt;
}
void solve ()
{
cin >> n;
vector<int > arr(n+1), pos(n+1);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |