oj.uz

답안 #118145

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
118145 2019-06-18T08:53:50 Z scanhex Naan (JOI19_naan) C++17
100 / 100
 556 ms 127224 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];
struct frac{
	nagai a,b;
	frac(){}
	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);
	vector<int>ptr(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;
			while(ptr[j]<m&&frac(pref[j][ptr[j]])<=frac(pref[j][m])*frac(i+1,n))
				++ptr[j];
			int L=ptr[j]-1;
			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);
			if(rest<mn)
				mn=rest,mni=j;
		}
		cur=mn;
		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 384 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 3 ms 484 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 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 484 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 3 ms 512 KB Output is correct
14 Correct 2 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 768 KB Output is correct
5 Correct 2 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 3 ms 512 KB Output is correct
9 Correct 4 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 640 KB Output is correct
14 Correct 2 ms 768 KB Output is correct
15 Correct 2 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 4 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 384 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 3 ms 484 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 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 484 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 3 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 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 768 KB Output is correct
20 Correct 2 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 3 ms 512 KB Output is correct
24 Correct 4 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 640 KB Output is correct
29 Correct 2 ms 768 KB Output is correct
30 Correct 2 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 4 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 39 ms 13176 KB Output is correct
44 Correct 247 ms 65240 KB Output is correct
45 Correct 153 ms 44024 KB Output is correct
46 Correct 25 ms 7544 KB Output is correct
47 Correct 184 ms 52344 KB Output is correct
48 Correct 187 ms 42492 KB Output is correct
49 Correct 64 ms 23388 KB Output is correct
50 Correct 344 ms 96336 KB Output is correct
51 Correct 175 ms 62712 KB Output is correct
52 Correct 351 ms 108816 KB Output is correct
53 Correct 279 ms 85112 KB Output is correct
54 Correct 2 ms 640 KB Output is correct
55 Correct 73 ms 16632 KB Output is correct
56 Correct 224 ms 79252 KB Output is correct
57 Correct 196 ms 62972 KB Output is correct
58 Correct 262 ms 76124 KB Output is correct
59 Correct 208 ms 71268 KB Output is correct
60 Correct 534 ms 127068 KB Output is correct
61 Correct 530 ms 127100 KB Output is correct
62 Correct 535 ms 126712 KB Output is correct
63 Correct 534 ms 127096 KB Output is correct
64 Correct 548 ms 127016 KB Output is correct
65 Correct 452 ms 127072 KB Output is correct
66 Correct 556 ms 127224 KB Output is correct
67 Correct 451 ms 127200 KB Output is correct
68 Correct 214 ms 63224 KB Output is correct
69 Correct 241 ms 78072 KB Output is correct
70 Correct 246 ms 69028 KB Output is correct
71 Correct 350 ms 101084 KB Output is correct