| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 123840 |
2019-07-02T07:48:45 Z |
이온조(#3029) |
Naan (JOI19_naan) |
C++14 |
|
40 ms |
3576 KB |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
#define X first
#define Y second
const pii INF = {1e9, 1};
int N, L, V[2009][2009], A[2009];
bool operator <(pii P, pii Q) {
return 1LL * P.X * Q.Y < 1LL * Q.X * P.Y;
}
pii f(__int128 a, __int128 b) {
__int128 gcd = __gcd(a, b);
return {a / gcd, b / gcd};
}
pii R(int i, pii st) {
if(st > INF) return INF;
int div = st.X / st.Y, mod = st.X % st.Y, lft = st.Y - mod;
__int128 a, b;
// lft / st.Y * V[i][div] >= A[i] / N
if(1LL * lft * V[i][div] * N >= 1LL * A[i] * st.Y) {
// ((a / b) - (st.X / st.Y)) * V[i][div] == A[i] / N
// ((a / b) - (st.X / st.Y)) * V[i][div] * N == A[i]
// (a / b) * V[i][div] * N - (st.X / st.Y) * V[i][div] * N == A[i]
// (a / b) * V[i][div] * N * st.Y - st.X * V[i][div] * N == A[i] * st.Y
// (a / b) * V[i][div] * N * st.Y = st.X * V[i][div] * N + A[i] * st.Y
a = 1LL * st.X * V[i][div] * N + 1LL * A[i] * st.Y;
b = 1LL * V[i][div] * N * st.Y;
return f(a, b);
}
else {
__int128 sa, sb;
sa = 1LL * lft * V[i][div]; sb = st.Y;
tie(sa, sb) = f(sa, sb);
for(int j=div+1; j<L; j++) {
// sa / sb + V[i][j] >= A[i] / N
if(1LL * sa * N + 1LL * V[i][j] * sb * N >= 1LL * A[i] * sb) {
// (a / b) * V[i][j] + (sa / sb) == A[i] / N
// a/b * V[i][j] * sb * N + sa * N == A[i] * sb
// a/b * V[i][j] * sb * N == A[i] * sb - sa * N;
b = 1LL * V[i][j] * sb * N;
a = 1LL * b * j + 1LL * A[i] * sb - 1LL * sa * N;
return f(a, b);
}
sa += 1LL * sb * V[i][j];
tie(sa, sb) = f(sa, sb);
}
}
return {1e9, 1};
}
int main() {
scanf("%d%d",&N,&L);
for(int i=1; i<=N; i++) {
for(int j=0; j<L; j++) {
scanf("%d",&V[i][j]);
A[i] += V[i][j];
}
}
vector<int> S, P;
vector<pii> ans; pii now = {0, 1};
for(int i=1; i<=N; i++) S.push_back(i);
for(int i=1; i<=N; i++) {
int mni = -1; pii mn = INF;
for(int j=0; j<S.size(); j++) {
pii tmp = R(S[j], now);
if(tmp < mn) mn = tmp, mni = j;
}
now = mn;
ans.push_back(now);
P.push_back(S[mni]);
if(mni == -1) return !printf("-1");
S.erase(S.begin() + mni);
}
if(now < (pii){L, 1} || now == (pii){L, 1}) {
for(int i=0; i<N-1; i++) printf("%d %d\n", ans[i].X, ans[i].Y);
for(auto& it: P) printf("%d ", it);
}
else puts("-1");
return 0;
}
Compilation message
naan.cpp: In function 'int main()':
naan.cpp:68:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j=0; j<S.size(); j++) {
~^~~~~~~~~
naan.cpp:56:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&N,&L);
~~~~~^~~~~~~~~~~~~~
naan.cpp:59:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&V[i][j]);
~~~~~^~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
504 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| 10 |
Correct |
2 ms |
376 KB |
Output is correct |
| 11 |
Correct |
3 ms |
376 KB |
Output is correct |
| 12 |
Correct |
3 ms |
376 KB |
Output is correct |
| 13 |
Correct |
3 ms |
380 KB |
Output is correct |
| 14 |
Correct |
3 ms |
376 KB |
Output is correct |
| 15 |
Correct |
3 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
3 ms |
376 KB |
Output is correct |
| 3 |
Correct |
3 ms |
380 KB |
Output is correct |
| 4 |
Correct |
3 ms |
376 KB |
Output is correct |
| 5 |
Correct |
3 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Correct |
3 ms |
376 KB |
Output is correct |
| 10 |
Correct |
3 ms |
376 KB |
Output is correct |
| 11 |
Correct |
3 ms |
376 KB |
Output is correct |
| 12 |
Correct |
2 ms |
376 KB |
Output is correct |
| 13 |
Correct |
2 ms |
376 KB |
Output is correct |
| 14 |
Correct |
3 ms |
376 KB |
Output is correct |
| 15 |
Correct |
3 ms |
376 KB |
Output is correct |
| 16 |
Correct |
3 ms |
376 KB |
Output is correct |
| 17 |
Correct |
3 ms |
376 KB |
Output is correct |
| 18 |
Correct |
3 ms |
376 KB |
Output is correct |
| 19 |
Correct |
3 ms |
376 KB |
Output is correct |
| 20 |
Correct |
3 ms |
376 KB |
Output is correct |
| 21 |
Correct |
3 ms |
376 KB |
Output is correct |
| 22 |
Correct |
3 ms |
376 KB |
Output is correct |
| 23 |
Correct |
2 ms |
256 KB |
Output is correct |
| 24 |
Correct |
3 ms |
404 KB |
Output is correct |
| 25 |
Correct |
3 ms |
376 KB |
Output is correct |
| 26 |
Correct |
2 ms |
376 KB |
Output is correct |
| 27 |
Correct |
3 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
504 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| 10 |
Correct |
2 ms |
376 KB |
Output is correct |
| 11 |
Correct |
3 ms |
376 KB |
Output is correct |
| 12 |
Correct |
3 ms |
376 KB |
Output is correct |
| 13 |
Correct |
3 ms |
380 KB |
Output is correct |
| 14 |
Correct |
3 ms |
376 KB |
Output is correct |
| 15 |
Correct |
3 ms |
376 KB |
Output is correct |
| 16 |
Correct |
2 ms |
376 KB |
Output is correct |
| 17 |
Correct |
3 ms |
376 KB |
Output is correct |
| 18 |
Correct |
3 ms |
380 KB |
Output is correct |
| 19 |
Correct |
3 ms |
376 KB |
Output is correct |
| 20 |
Correct |
3 ms |
376 KB |
Output is correct |
| 21 |
Correct |
2 ms |
376 KB |
Output is correct |
| 22 |
Correct |
2 ms |
376 KB |
Output is correct |
| 23 |
Correct |
2 ms |
376 KB |
Output is correct |
| 24 |
Correct |
3 ms |
376 KB |
Output is correct |
| 25 |
Correct |
3 ms |
376 KB |
Output is correct |
| 26 |
Correct |
3 ms |
376 KB |
Output is correct |
| 27 |
Correct |
2 ms |
376 KB |
Output is correct |
| 28 |
Correct |
2 ms |
376 KB |
Output is correct |
| 29 |
Correct |
3 ms |
376 KB |
Output is correct |
| 30 |
Correct |
3 ms |
376 KB |
Output is correct |
| 31 |
Correct |
3 ms |
376 KB |
Output is correct |
| 32 |
Correct |
3 ms |
376 KB |
Output is correct |
| 33 |
Correct |
3 ms |
376 KB |
Output is correct |
| 34 |
Correct |
3 ms |
376 KB |
Output is correct |
| 35 |
Correct |
3 ms |
376 KB |
Output is correct |
| 36 |
Correct |
3 ms |
376 KB |
Output is correct |
| 37 |
Correct |
3 ms |
376 KB |
Output is correct |
| 38 |
Correct |
2 ms |
256 KB |
Output is correct |
| 39 |
Correct |
3 ms |
404 KB |
Output is correct |
| 40 |
Correct |
3 ms |
376 KB |
Output is correct |
| 41 |
Correct |
2 ms |
376 KB |
Output is correct |
| 42 |
Correct |
3 ms |
376 KB |
Output is correct |
| 43 |
Incorrect |
40 ms |
3576 KB |
Integer parameter [name=A_i] equals to -1, violates the range [1, 2000000000000] |
| 44 |
Halted |
0 ms |
0 KB |
- |
