oj.uz

답안 #524359

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
524359 2022-02-09T06:07:52 Z ymm Naan (JOI19_naan) C++17
29 / 100
 243 ms 262144 KB 
///
///   Oh? You're approaching me?
///

#include <bits/stdc++.h>
#define Loop(x,l,r) for(ll x = ll(l); x < ll(r); ++x)
#define LoopR(x,l,r) for(ll x = ll(r)-1; x >= ll(l); --x)
#define Kill(x) exit((cout << (x) << '\n', 0))
typedef __int128 ll;
typedef std::pair<int,int> pii;
typedef std::pair<ll,ll> pll;
using namespace std;

struct frac{
	ll a, b;
	frac(){a=0;b=1;}
	frac(ll x){a=x;b=1;}
	frac(ll x, ll y){a=x;b=y;}
};
frac red(frac f){ll g = __gcd(f.a, f.b); return {f.a/g, f.b/g};}
frac operator+(frac a, frac b){return red({a.a*b.b + b.a*a.b, a.b*b.b});}
frac operator-(frac a, frac b){return red({a.a*b.b - b.a*a.b, a.b*b.b});}
frac operator*(frac a, frac b){return red({a.a*b.a, a.b*b.b});}
frac operator/(frac a, frac b){return red({a.a*b.b, a.b*b.a});}
bool operator<(frac a, frac b){return a.a*b.b < b.a*a.b;}
bool operator<=(frac a, frac b){return a.a*b.b <= b.a*a.b;}
ll flr(frac a){return a.a/a.b;}
ll cil(frac a){return (a.a + a.b -1)/a.b;}

const int N = 2022;
ll v[N][N]; frac ps[N][N];
bool done[N];
ll n, m;

frac nxt(frac f, int i){
	frac sm = (cil(f)-f)*v[i][flr(f)];
	if(ps[i][m]/n <= sm) return f + (ps[i][m]/n)/v[i][flr(f)];
	ll l = cil(f);
	ll r = lower_bound(ps[i], ps[i]+m+1, ps[i][m]/n-sm+ps[i][l])-ps[i];
	if(r==m+1) return m+1;
	--r;
	sm = sm+ps[i][r]-ps[i][l];
	return r + (ps[i][m]/n - sm)/v[i][r];
}

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	long long tmp1, tmp2;
	cin >> tmp1 >> tmp2;
	n = tmp1; m = tmp2;
	Loop(i,0,n) Loop(j,0,m) {
		cin >> tmp1;
		v[i][j] = tmp1;
		ps[i][j+1] = ps[i][j]+v[i][j];
	}
	frac cur = 0;
	vector<pair<frac,int>> vec;
	Loop(i,0,n) {
		frac mn = m+1;
		int mni = -1;
		Loop(j,0,n){
			if(done[j]) continue;
			frac f = red(nxt(cur, j));
			if(f < mn){
				mn = f;
				mni = j;
			}
		}
		if(mni==-1) Kill(-1);
		done[mni]=1;
		vec.push_back({mn,mni});
		cur=mn;
	}
	Loop(i,0,n-1){
		cout << (long long)vec[i].first.a << ' ' << (long long)vec[i].first.b << '\n';
	}
	Loop(i,0,n) cout << vec[i].second+1 << ' ';
	cout << '\n';
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 128264 KB Output is correct
2 Correct 48 ms 128284 KB Output is correct
3 Correct 47 ms 128324 KB Output is correct
4 Correct 52 ms 128324 KB Output is correct
5 Correct 49 ms 128360 KB Output is correct
6 Correct 49 ms 128220 KB Output is correct
7 Correct 48 ms 128324 KB Output is correct
8 Correct 49 ms 128380 KB Output is correct
9 Correct 50 ms 128212 KB Output is correct
10 Correct 49 ms 128368 KB Output is correct
11 Correct 48 ms 128324 KB Output is correct
12 Correct 48 ms 128368 KB Output is correct
13 Correct 51 ms 128452 KB Output is correct
14 Correct 49 ms 128344 KB Output is correct
15 Correct 48 ms 128360 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 128324 KB Output is correct
2 Correct 53 ms 128356 KB Output is correct
3 Correct 49 ms 128360 KB Output is correct
4 Correct 49 ms 128420 KB Output is correct
5 Correct 54 ms 128460 KB Output is correct
6 Correct 49 ms 128324 KB Output is correct
7 Correct 49 ms 128324 KB Output is correct
8 Correct 49 ms 128324 KB Output is correct
9 Correct 49 ms 128408 KB Output is correct
10 Correct 51 ms 128404 KB Output is correct
11 Correct 50 ms 128344 KB Output is correct
12 Correct 51 ms 128328 KB Output is correct
13 Correct 48 ms 128412 KB Output is correct
14 Correct 49 ms 128456 KB Output is correct
15 Correct 49 ms 128356 KB Output is correct
16 Correct 50 ms 128436 KB Output is correct
17 Correct 50 ms 128436 KB Output is correct
18 Correct 50 ms 128492 KB Output is correct
19 Correct 52 ms 128508 KB Output is correct
20 Correct 49 ms 128456 KB Output is correct
21 Correct 49 ms 128452 KB Output is correct
22 Correct 51 ms 128404 KB Output is correct
23 Correct 51 ms 128320 KB Output is correct
24 Correct 51 ms 128372 KB Output is correct
25 Correct 52 ms 128340 KB Output is correct
26 Correct 50 ms 128324 KB Output is correct
27 Correct 54 ms 128432 KB Output is correct

Subtask #3
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 128264 KB Output is correct
2 Correct 48 ms 128284 KB Output is correct
3 Correct 47 ms 128324 KB Output is correct
4 Correct 52 ms 128324 KB Output is correct
5 Correct 49 ms 128360 KB Output is correct
6 Correct 49 ms 128220 KB Output is correct
7 Correct 48 ms 128324 KB Output is correct
8 Correct 49 ms 128380 KB Output is correct
9 Correct 50 ms 128212 KB Output is correct
10 Correct 49 ms 128368 KB Output is correct
11 Correct 48 ms 128324 KB Output is correct
12 Correct 48 ms 128368 KB Output is correct
13 Correct 51 ms 128452 KB Output is correct
14 Correct 49 ms 128344 KB Output is correct
15 Correct 48 ms 128360 KB Output is correct
16 Correct 48 ms 128324 KB Output is correct
17 Correct 53 ms 128356 KB Output is correct
18 Correct 49 ms 128360 KB Output is correct
19 Correct 49 ms 128420 KB Output is correct
20 Correct 54 ms 128460 KB Output is correct
21 Correct 49 ms 128324 KB Output is correct
22 Correct 49 ms 128324 KB Output is correct
23 Correct 49 ms 128324 KB Output is correct
24 Correct 49 ms 128408 KB Output is correct
25 Correct 51 ms 128404 KB Output is correct
26 Correct 50 ms 128344 KB Output is correct
27 Correct 51 ms 128328 KB Output is correct
28 Correct 48 ms 128412 KB Output is correct
29 Correct 49 ms 128456 KB Output is correct
30 Correct 49 ms 128356 KB Output is correct
31 Correct 50 ms 128436 KB Output is correct
32 Correct 50 ms 128436 KB Output is correct
33 Correct 50 ms 128492 KB Output is correct
34 Correct 52 ms 128508 KB Output is correct
35 Correct 49 ms 128456 KB Output is correct
36 Correct 49 ms 128452 KB Output is correct
37 Correct 51 ms 128404 KB Output is correct
38 Correct 51 ms 128320 KB Output is correct
39 Correct 51 ms 128372 KB Output is correct
40 Correct 52 ms 128340 KB Output is correct
41 Correct 50 ms 128324 KB Output is correct
42 Correct 54 ms 128432 KB Output is correct
43 Runtime error 243 ms 262144 KB Execution killed with signal 8
44 Halted 0 ms 0 KB -