oj.uz

답안 #118138

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
118138 2019-06-18T08:43:26 Z scanhex Naan (JOI19_naan) C++17
100 / 100
 1149 ms 127376 KB 
#include <bits/stdc++.h>

using namespace std;
using nagai = __int128;
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{
	nagai a,b;
	frac(){}
	void check(){
		if(a==0)return;
		nagai g=gcd(a,b);
		a/=g;
		b/=g;
	}
	frac(nagai a,nagai b):a(a),b(b){
	}
	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;
	}
};
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;
			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;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 512 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 3 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 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 2 ms 640 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 2 ms 512 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 2 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 768 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 3 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 3 ms 640 KB Output is correct
25 Correct 3 ms 640 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 3 ms 640 KB Output is correct

Subtask #3
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 512 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 3 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 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 2 ms 640 KB Output is correct
21 Correct 3 ms 512 KB Output is correct
22 Correct 2 ms 512 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 2 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 768 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 3 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 3 ms 640 KB Output is correct
40 Correct 3 ms 640 KB Output is correct
41 Correct 2 ms 512 KB Output is correct
42 Correct 3 ms 640 KB Output is correct
43 Correct 92 ms 13176 KB Output is correct
44 Correct 599 ms 65256 KB Output is correct
45 Correct 234 ms 44152 KB Output is correct
46 Correct 26 ms 7544 KB Output is correct
47 Correct 357 ms 52472 KB Output is correct
48 Correct 888 ms 42624 KB Output is correct
49 Correct 204 ms 23544 KB Output is correct
50 Correct 1128 ms 96372 KB Output is correct
51 Correct 402 ms 62876 KB Output is correct
52 Correct 943 ms 109004 KB Output is correct
53 Correct 844 ms 85404 KB Output is correct
54 Correct 3 ms 640 KB Output is correct
55 Correct 359 ms 16744 KB Output is correct
56 Correct 506 ms 79420 KB Output is correct
57 Correct 426 ms 62972 KB Output is correct
58 Correct 736 ms 76128 KB Output is correct
59 Correct 427 ms 71288 KB Output is correct
60 Correct 1016 ms 127168 KB Output is correct
61 Correct 1101 ms 126920 KB Output is correct
62 Correct 1132 ms 126808 KB Output is correct
63 Correct 1103 ms 126972 KB Output is correct
64 Correct 1115 ms 127040 KB Output is correct
65 Correct 1149 ms 127060 KB Output is correct
66 Correct 1080 ms 127376 KB Output is correct
67 Correct 953 ms 127276 KB Output is correct
68 Correct 413 ms 63352 KB Output is correct
69 Correct 438 ms 78032 KB Output is correct
70 Correct 545 ms 69144 KB Output is correct
71 Correct 659 ms 101244 KB Output is correct