# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
923920 | ezzzay | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 1 ms | 412 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>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
#define inf 1e17
const int N=15;
int arr[N][N];
int cur[N],pw[N];
signed main(){
int n,m;
cin>>n>>m;
vector<int>v;
for(int i=0;i<m;i++){
cin>>cur[i]>>pw[i];
}
for(int i=0;i<m;i++)v.pb(i);
int ans=INT_MAX;
do{
if(v[m-1]!=1 or v[0]!=0)continue;
int s=0;
for(int i=0;i<m-1;i++){
int k=abs(cur[v[i]]-cur[v[i+1]]);
int h=k/pw[i];
if(k%pw[i])h++;
s+=h;
};
# | 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... |