# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1023970 | Otalp | Catfish Farm (IOI22_fish) | C++17 | 739 ms | 249244 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 "fish.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define pii pair<int, int>
#define ff first
#define ss second
const int MAXN = 500100;
int n, w[MAXN], m;
pii a[MAXN];
namespace B{
unordered_map<ll, ll> d[200100];
unordered_map<ll, ll> dp[200100];
unordered_map<ll, ll> pref[200100];
unordered_map<ll, ll> ddp[200100];
vector<ll> pos[200100];
ll suf[200100];
ll solve(){
for(ll i=1; i<=m; i++){
d[a[i].ff][a[i].ss] += w[i];
}
for(int i=0; i<=n; i++){
d[i][0] += 0;
d[i][n] += 0;
}
for(int i=0; i<=n; i++){
for(auto h: d[i]){
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... |
# | 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... |