# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
810178 | vjudge1 | Worst Reporter 4 (JOI21_worst_reporter4) | C++17 | 185 ms | 197096 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;
using ll = long long;
const int N = 5e3 + 10;
int n;
vector<int> G[N];
int a[N], h[N], c[N];
void compress() {
map<int, int> mp;
for(int i = 1; i <= n; i++)
mp[h[i]] = 1;
int k = 0;
for(auto &c : mp) {
c.second = k++;
}
for(int i = 1; i <= n; i++)
h[i] = mp[h[i]];
}
ll f[N][N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i++) {
cin >> a[i];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |