# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45722 | Talant | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 2 ms | 660 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 fr first
#define sc second
#define OK puts("OK");
#define pb push_back
#define mk make_pair
#define int long long
using namespace std;
typedef long long ll;
const int inf = (int)1e15 + 7;
const int N = (int)2e5 + 7;
int n,m;
int p[N],b[N];
int mn = inf;
vector <int> v;
bool check (int l,int r) {
if (abs(b[l] - b[r]) % p[l] == 0)
return true;
return false;
}
int f(int l,int r) {
return (abs(b[l] - b[r]) / p[l]);
}
main () {
cin >> n >> m;
if (m <= 15) {
for (int i = 1; i <= m; i ++) {
cin >> b[i] >> p[i];
}
for (int i = 2; i <= m; i ++)
v.pb(i);
do {
int cur = 1,ans = 0;;
for (int i = 0; i < v.size(); i ++) {
if (check(cur,v[i]))
ans += f(cur,v[i]);
else {
cur = -1;
break;
}
cur = v[i];
}
if (cur != -1)
mn = min(mn,ans);
}while(next_permutation(v.begin(),v.end()));
if (mn == inf)
cout << "-1" << endl;
else
cout << mn << endl;
}
else {
puts("-1");
}
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |