# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
163942 | georgerapeanu | Naan (JOI19_naan) | C++11 | 1852 ms | 101024 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 <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
const int NMAX = 2000;
const int LMAX = 2000;
int n,l;
int v[NMAX + 5][LMAX + 5];
pair<long long,long long> split[NMAX + 5][NMAX + 5];
long long sum[NMAX + 5];
bool seen[NMAX + 5];
vector<int> perm;
long long gcd(long long a,long long b){
if(!b){
return a;
}
return gcd(b,a % b);
}
bool cmp_frac(const pair<long long,long long> &a,const pair<long long,long long> &b){
return (long double)a.first / a.second < (long double)b.first / b.second;
}
int main(){
scanf("%d %d",&n,&l);
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... |