# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112972 | CaroLinda | 쌀 창고 (IOI11_ricehub) | C++14 | 1078 ms | 848 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>
#include "ricehub.h"
#define lp(i,a,b) for(int i = a ; i < b ; i++ )
#define pii pair<int,int>
#define ff first
#define ss second
#define mk make_pair
#define pb push_back
#define ll long long
const int MAXN = 5005 ;
const int inf = 1e9 + 10 ;
using namespace std ;
//Declarations
int r , l ;
ll b ;
int x[MAXN] ;
int test(int k)
{
int ans = 0 ;
vector<int> d ;
lp(i,0,r)
d.pb( abs( x[k] - x[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... |