| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 310548 | talant117408 | 말 (IOI15_horses) | C++17 | 0 ms | 0 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 "horses.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) (int)(v).size()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const ll mod = 1e9+7;
int n;
ll x[1007], y[1007];
pair <ll, ll> year[1007];
int init(int N, int X[], int Y[]) {
n = N;
copy(X, X+n, x);
copy(Y, Y+n, y);
ll res = x[0];
year[0] = {0, x[0]};
for(int i = 1; i < n; i++){
year[i].first = year[i-1].first;
year[i].second = year[i-1].second/y[i-1]*x[i]*y[i];
}
sort(year, year+n);
return year[0].second;
}
int updateX(int pos, int val){
return 0;
}
int updateY(int pos, int val){
return 0;
}
/*
3
2 1 3
3 4 1
1
2 1 2
8
6
*
