# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
118135 |
2019-06-18T08:40:04 Z |
scanhex |
Naan (JOI19_naan) |
C++17 |
|
1381 ms |
149400 KB |
#include <bits/stdc++.h>
using namespace std;
using nagai = __int128;
using big=__int128;
using unagai=unsigned long long;
using ll=long long;
#define sz(x) int((x).size())
const int N=2020;
int n,m;
nagai matr[N][N];
nagai pref[N][N];
nagai gcd(nagai a,nagai b){
while(b){
a%=b,swap(a,b);
}
return a;
}
struct frac;
frac find(frac a,frac b);
const nagai C=1000000000LL;
struct frac{
nagai a,b;
frac(){}
void find(){
if(b<=C)return;
frac r(a+1,b,0);
int it=0;
while(true){
if(++it>40)break;
frac nw=::find(*this,r);
// cerr<<r.a<<' '<<r.b<<'\n';
if(nw.a==a&&nw.b==b)return;
if(nw.b>C){
a=r.a,b=r.b;
return;
}
r=nw;
}
}
void check(){
if(a==0)return;
nagai g=gcd(a,b);
a/=g;
b/=g;
// find();
}
frac(nagai a,nagai b,bool ch=false):a(a),b(b){
if(ch)
check();
}
frac(nagai x):a(x),b(1){}
frac operator *(frac o){
return frac(a*o.a,b*o.b);
}
frac operator +(frac o){
return frac(a*o.b+o.a*b,b*o.b);
}
frac operator -(frac o){
return frac(a*o.b-o.a*b,b*o.b);
}
bool operator <=(frac o){
return a*o.b<=b*o.a;
}
bool operator <(frac o){
return a*o.b<b*o.a;
}
};
frac find(frac l, frac r){
//cerr<<l.a<<' '<<l.b<<' '<<r.a<<' '<<r.b<<'\n';
if(l.a>=l.b){
nagai d=l.a/l.b;
frac ans=find(frac(l.a-l.b*d,l.b,0),frac(r.a-r.b*d,r.b,0));
ans.a+=ans.b*d;
return ans;
}
if(r.a>r.b)
return frac(1,1,0);
frac ans=find(frac(r.b,r.a,0),frac(l.b,l.a,0));
swap(ans.a,ans.b);
return ans;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m;
for(int i=0;i<n;++i)
for(int j=0;j<m;++j){
ll x;
cin>>x;
matr[i][j]=x;
pref[i][j+1]=pref[i][j]+matr[i][j];
}
frac cur(0);
vector<frac>fr;
vector<int>ord;
vector<bool>used(n);
for(int i=0;i<n;++i){
frac mn(1e9);
int mni=-1;
for(int j=0;j<n;++j){
if(used[j])continue;
// frac kek=frac(matr[j][lb])*frac(cur.a%cur.b,cur.b);
int L=0,R=m+1;
while(R-L>1){
int M=(L+R)/2;
if(frac(pref[j][M])<=frac(pref[j][m])*frac(i+1,n))
L=M;
else
R=M;
}
frac rest(0);
rest=frac(pref[j][m])*frac(i+1,n)-frac(pref[j][L]);
if(rest.a)
rest=rest*frac(1,matr[j][L]);
rest=rest+frac(L);
rest.check();
if(rest<mn)
mn=rest,mni=j;
}
cur=mn;
// cerr<<cur.a<<' '<<cur.b<<'\n';
fr.push_back(cur);
ord.push_back(mni);
used[mni]=true;
}
for(int i=0;i<n-1;++i){
cout<<(ll)fr[i].a<<' '<<(ll)fr[i].b<<'\n';
}
for(int i=0;i<n;++i)
cout<<ord[i]+1<<' ';
cout<<'\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
512 KB |
Output is correct |
4 |
Correct |
3 ms |
512 KB |
Output is correct |
5 |
Correct |
2 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Correct |
2 ms |
384 KB |
Output is correct |
8 |
Correct |
2 ms |
512 KB |
Output is correct |
9 |
Correct |
2 ms |
384 KB |
Output is correct |
10 |
Correct |
2 ms |
512 KB |
Output is correct |
11 |
Correct |
2 ms |
512 KB |
Output is correct |
12 |
Correct |
2 ms |
512 KB |
Output is correct |
13 |
Correct |
2 ms |
512 KB |
Output is correct |
14 |
Correct |
2 ms |
512 KB |
Output is correct |
15 |
Correct |
2 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
512 KB |
Output is correct |
3 |
Correct |
2 ms |
640 KB |
Output is correct |
4 |
Correct |
2 ms |
640 KB |
Output is correct |
5 |
Correct |
3 ms |
640 KB |
Output is correct |
6 |
Correct |
2 ms |
512 KB |
Output is correct |
7 |
Correct |
2 ms |
384 KB |
Output is correct |
8 |
Correct |
2 ms |
512 KB |
Output is correct |
9 |
Correct |
3 ms |
768 KB |
Output is correct |
10 |
Correct |
3 ms |
768 KB |
Output is correct |
11 |
Correct |
3 ms |
640 KB |
Output is correct |
12 |
Correct |
2 ms |
384 KB |
Output is correct |
13 |
Correct |
2 ms |
512 KB |
Output is correct |
14 |
Correct |
3 ms |
768 KB |
Output is correct |
15 |
Correct |
3 ms |
640 KB |
Output is correct |
16 |
Correct |
3 ms |
768 KB |
Output is correct |
17 |
Correct |
3 ms |
768 KB |
Output is correct |
18 |
Correct |
3 ms |
768 KB |
Output is correct |
19 |
Correct |
3 ms |
768 KB |
Output is correct |
20 |
Correct |
2 ms |
640 KB |
Output is correct |
21 |
Correct |
3 ms |
768 KB |
Output is correct |
22 |
Correct |
3 ms |
768 KB |
Output is correct |
23 |
Correct |
2 ms |
384 KB |
Output is correct |
24 |
Correct |
2 ms |
640 KB |
Output is correct |
25 |
Correct |
2 ms |
640 KB |
Output is correct |
26 |
Correct |
2 ms |
512 KB |
Output is correct |
27 |
Correct |
2 ms |
640 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
512 KB |
Output is correct |
4 |
Correct |
3 ms |
512 KB |
Output is correct |
5 |
Correct |
2 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Correct |
2 ms |
384 KB |
Output is correct |
8 |
Correct |
2 ms |
512 KB |
Output is correct |
9 |
Correct |
2 ms |
384 KB |
Output is correct |
10 |
Correct |
2 ms |
512 KB |
Output is correct |
11 |
Correct |
2 ms |
512 KB |
Output is correct |
12 |
Correct |
2 ms |
512 KB |
Output is correct |
13 |
Correct |
2 ms |
512 KB |
Output is correct |
14 |
Correct |
2 ms |
512 KB |
Output is correct |
15 |
Correct |
2 ms |
512 KB |
Output is correct |
16 |
Correct |
2 ms |
384 KB |
Output is correct |
17 |
Correct |
2 ms |
512 KB |
Output is correct |
18 |
Correct |
2 ms |
640 KB |
Output is correct |
19 |
Correct |
2 ms |
640 KB |
Output is correct |
20 |
Correct |
3 ms |
640 KB |
Output is correct |
21 |
Correct |
2 ms |
512 KB |
Output is correct |
22 |
Correct |
2 ms |
384 KB |
Output is correct |
23 |
Correct |
2 ms |
512 KB |
Output is correct |
24 |
Correct |
3 ms |
768 KB |
Output is correct |
25 |
Correct |
3 ms |
768 KB |
Output is correct |
26 |
Correct |
3 ms |
640 KB |
Output is correct |
27 |
Correct |
2 ms |
384 KB |
Output is correct |
28 |
Correct |
2 ms |
512 KB |
Output is correct |
29 |
Correct |
3 ms |
768 KB |
Output is correct |
30 |
Correct |
3 ms |
640 KB |
Output is correct |
31 |
Correct |
3 ms |
768 KB |
Output is correct |
32 |
Correct |
3 ms |
768 KB |
Output is correct |
33 |
Correct |
3 ms |
768 KB |
Output is correct |
34 |
Correct |
3 ms |
768 KB |
Output is correct |
35 |
Correct |
2 ms |
640 KB |
Output is correct |
36 |
Correct |
3 ms |
768 KB |
Output is correct |
37 |
Correct |
3 ms |
768 KB |
Output is correct |
38 |
Correct |
2 ms |
384 KB |
Output is correct |
39 |
Correct |
2 ms |
640 KB |
Output is correct |
40 |
Correct |
2 ms |
640 KB |
Output is correct |
41 |
Correct |
2 ms |
512 KB |
Output is correct |
42 |
Correct |
2 ms |
640 KB |
Output is correct |
43 |
Correct |
103 ms |
13184 KB |
Output is correct |
44 |
Correct |
676 ms |
75104 KB |
Output is correct |
45 |
Correct |
276 ms |
51608 KB |
Output is correct |
46 |
Correct |
28 ms |
8568 KB |
Output is correct |
47 |
Correct |
432 ms |
60636 KB |
Output is correct |
48 |
Correct |
1034 ms |
44408 KB |
Output is correct |
49 |
Correct |
235 ms |
24592 KB |
Output is correct |
50 |
Correct |
1305 ms |
101964 KB |
Output is correct |
51 |
Correct |
444 ms |
66424 KB |
Output is correct |
52 |
Correct |
1119 ms |
116120 KB |
Output is correct |
53 |
Correct |
954 ms |
90012 KB |
Output is correct |
54 |
Correct |
3 ms |
640 KB |
Output is correct |
55 |
Correct |
432 ms |
16988 KB |
Output is correct |
56 |
Correct |
632 ms |
83640 KB |
Output is correct |
57 |
Correct |
483 ms |
66296 KB |
Output is correct |
58 |
Correct |
859 ms |
80148 KB |
Output is correct |
59 |
Correct |
487 ms |
75384 KB |
Output is correct |
60 |
Correct |
1258 ms |
149240 KB |
Output is correct |
61 |
Correct |
1298 ms |
149112 KB |
Output is correct |
62 |
Correct |
1381 ms |
148656 KB |
Output is correct |
63 |
Correct |
1301 ms |
149400 KB |
Output is correct |
64 |
Correct |
1279 ms |
149368 KB |
Output is correct |
65 |
Correct |
1269 ms |
135772 KB |
Output is correct |
66 |
Correct |
1269 ms |
135828 KB |
Output is correct |
67 |
Correct |
1227 ms |
135768 KB |
Output is correct |
68 |
Correct |
507 ms |
69216 KB |
Output is correct |
69 |
Correct |
508 ms |
85880 KB |
Output is correct |
70 |
Correct |
633 ms |
75484 KB |
Output is correct |
71 |
Correct |
801 ms |
112016 KB |
Output is correct |