| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1106198 | Bananabread | Harvest (JOI20_harvest) | C++17 | 1464 ms | 337224 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 ll long long
#define ntr "\n"
#define mod (ll)(1e9+7)
#define taskname ""
#define frep freopen(taskname".inp","r",stdin); freopen(taskname".out","w",stdout);
using namespace std;
ll a[5001],b[5001];
ll n,m,l,c,q;
vector<pair<ll,ll>> adj[7001];
ll loop1[7001][3001];
ll loop2[7001][3001];
ll vis[7001];
ll par;
void dfs(ll u,ll dist){
if(vis[u]>=2) return ;
vis[u]++;
if(vis[u]==1) loop1[u][par]=dist;
else loop2[u][par]=dist;
for(auto [v,w]:adj[u]){
dfs(v,dist+w);
}
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
//frep;
cin>>n>>m>>l>>c;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=m;i++) cin>>b[i];
for(int i=1;i<=n;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... | ||||