# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22950 | gs14004 | Unifying Values (KRIII5_UV) | C++11 | 143 ms | 3752 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;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
const int mod = 1e9 + 7;
int n;
lint a[10005];
vector<int> v[10005];
vector<lint> dyn[10005];
lint dabs(lint x){ return max(x, -x); }
lint solve(int x){
for(int i=0; i<=x; i++){
v[i].clear();
dyn[i].clear();
}
lint q = a[n] / x;
for(int i=0; i<=n; i++){
if(dabs(a[i]) % dabs(q) == 0){
if(a[i] / q <= x && a[i]/q >= 0) v[a[i] / q].push_back(i);
}
}
for(int i=0; i<=x; i++){
if(v[i].size() == 0) return 0;
dyn[i].resize(v[i].size());
}
dyn[0][0] = 1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |