oj.uz

답안 #533385

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533385 2022-03-05T20:37:16 Z pooyashams Naan (JOI19_naan) C++14
29 / 100
 659 ms 130512 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cstring>
#include <iomanip>
#include <vector>
#include <bitset>
#include <stack>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>

using namespace std;
typedef __int128 ll;
typedef long double ld;
typedef pair<int, int> pii;

const ll inf = 1e18;

struct mfint
{
	ll a, b; // a/b
	mfint()
	{
		a = 1;
		b = 1;
	}
	mfint(ll _a)
	{
		a = _a;
		b = 1;
	}
	mfint(ll _a, ll _b)
	{
		a = _a;
		b = _b;
	}
	inline void simp()
	{
		ll x = __gcd(a, b);
		a /= x;
		b /= x;
	}
	inline ll floor()
	{
		return a/b;
	}
	inline ll ceil()
	{
		return (a+b-1)/b;
	}
	inline mfint operator+(mfint y)
	{
		mfint x;
		x.b = b*y.b;
		x.a = a*y.b + b*y.a;
		x.simp();
		return x;
	}
	inline mfint operator-(mfint y)
	{
		mfint x;
		x.b = b*y.b;
		x.a = a*y.b - b*y.a;
		x.simp();
		return x;
	}
	inline mfint operator*(mfint y)
	{
		mfint x;
		x.a = a*y.a;
		x.b = b*y.b;
		x.simp();
		return x;
	}
	inline mfint operator/(mfint y)
	{
		mfint x;
		x.a = a*y.b;
		x.b = b*y.a;
		x.simp();
		return x;
	}
	inline bool operator<(mfint y)
	{
		return a*y.b < b*y.a;
	}
	inline bool operator<=(mfint y)
	{
		return a*y.b <= b*y.a;
	}
	inline bool operator>(mfint y)
	{
		return a*y.b > b*y.a;
	}
	inline bool operator>=(mfint y)
	{
		return a*y.b >= b*y.a;
	}
	inline bool operator==(mfint y)
	{
		return a*y.b == b*y.a;
	}
};

const int maxn = 2012;

int vals[maxn][maxn];
mfint vmf[maxn][maxn];
mfint avgs[maxn];

int n, L;

inline mfint nxtf(int i, mfint f)
{
	mfint a = avgs[i];
	int xv = f.floor();
	mfint x = mfint(xv);
	mfint res;
	res = vmf[i][xv] * (res-f+x);
	if(res >= a)
		return f+(a/vmf[i][xv]);
	a = a-res;
	xv++;
	while(xv < L)
	{
		if(vmf[i][xv] >= a)
			return mfint(xv) + (a/vmf[i][xv]);
		else
			a = a-vmf[i][xv];
		xv++;
	}
	return mfint(-1);
}

int32_t main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> L;
	for(int i = 0; i < n; i++)
	{
		int s = 0;
		for(int j = 0; j < L; j++)
		{
			cin >> vals[i][j];
			vmf[i][j] = mfint(vals[i][j]);
			s += vals[i][j];
		}
		avgs[i] = mfint(s, n);
	}
	vector<mfint> divs;
	vector<int> prm;
	vector<int> rems(n);
	iota(rems.begin(), rems.end(), 0);
	mfint lf(0);
	for(int i = 0; i < n; i++)
	{
		mfint bst = nxtf(rems[0], lf);
		int bid = rems[0];
		for(int j: rems)
		{
			mfint enf = nxtf(j, lf);
			if(enf <= bst)
			{
				bst = enf;
				bid = j;
			}
		}
		lf = bst;
		divs.push_back(bst);
		prm.push_back(bid);
		rems.erase(find(rems.begin(), rems.end(), bid));
	}
	divs.pop_back();
	for(auto x: divs)
		cout << (long long)(x.a) << " " << (long long)(x.b) << endl;
	for(int i: prm)
		cout << i+1 << " ";
	cout << endl;
	return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 127044 KB Output is correct
2 Correct 66 ms 127100 KB Output is correct
3 Correct 51 ms 127124 KB Output is correct
4 Correct 52 ms 127060 KB Output is correct
5 Correct 51 ms 127044 KB Output is correct
6 Correct 52 ms 127048 KB Output is correct
7 Correct 54 ms 127120 KB Output is correct
8 Correct 52 ms 127100 KB Output is correct
9 Correct 51 ms 126992 KB Output is correct
10 Correct 60 ms 127132 KB Output is correct
11 Correct 52 ms 127040 KB Output is correct
12 Correct 51 ms 127064 KB Output is correct
13 Correct 52 ms 127052 KB Output is correct
14 Correct 52 ms 127044 KB Output is correct
15 Correct 53 ms 127044 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 127120 KB Output is correct
2 Correct 52 ms 127108 KB Output is correct
3 Correct 59 ms 127116 KB Output is correct
4 Correct 52 ms 127056 KB Output is correct
5 Correct 59 ms 127044 KB Output is correct
6 Correct 54 ms 127044 KB Output is correct
7 Correct 51 ms 127060 KB Output is correct
8 Correct 53 ms 127056 KB Output is correct
9 Correct 53 ms 127160 KB Output is correct
10 Correct 52 ms 127160 KB Output is correct
11 Correct 49 ms 127040 KB Output is correct
12 Correct 65 ms 127020 KB Output is correct
13 Correct 53 ms 127044 KB Output is correct
14 Correct 53 ms 127044 KB Output is correct
15 Correct 50 ms 127128 KB Output is correct
16 Correct 49 ms 127124 KB Output is correct
17 Correct 50 ms 127044 KB Output is correct
18 Correct 50 ms 127044 KB Output is correct
19 Correct 51 ms 127136 KB Output is correct
20 Correct 57 ms 127076 KB Output is correct
21 Correct 55 ms 127100 KB Output is correct
22 Correct 49 ms 127056 KB Output is correct
23 Correct 49 ms 127040 KB Output is correct
24 Correct 51 ms 127040 KB Output is correct
25 Correct 51 ms 127044 KB Output is correct
26 Correct 53 ms 127040 KB Output is correct
27 Correct 57 ms 127088 KB Output is correct

Subtask #3
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 127044 KB Output is correct
2 Correct 66 ms 127100 KB Output is correct
3 Correct 51 ms 127124 KB Output is correct
4 Correct 52 ms 127060 KB Output is correct
5 Correct 51 ms 127044 KB Output is correct
6 Correct 52 ms 127048 KB Output is correct
7 Correct 54 ms 127120 KB Output is correct
8 Correct 52 ms 127100 KB Output is correct
9 Correct 51 ms 126992 KB Output is correct
10 Correct 60 ms 127132 KB Output is correct
11 Correct 52 ms 127040 KB Output is correct
12 Correct 51 ms 127064 KB Output is correct
13 Correct 52 ms 127052 KB Output is correct
14 Correct 52 ms 127044 KB Output is correct
15 Correct 53 ms 127044 KB Output is correct
16 Correct 51 ms 127120 KB Output is correct
17 Correct 52 ms 127108 KB Output is correct
18 Correct 59 ms 127116 KB Output is correct
19 Correct 52 ms 127056 KB Output is correct
20 Correct 59 ms 127044 KB Output is correct
21 Correct 54 ms 127044 KB Output is correct
22 Correct 51 ms 127060 KB Output is correct
23 Correct 53 ms 127056 KB Output is correct
24 Correct 53 ms 127160 KB Output is correct
25 Correct 52 ms 127160 KB Output is correct
26 Correct 49 ms 127040 KB Output is correct
27 Correct 65 ms 127020 KB Output is correct
28 Correct 53 ms 127044 KB Output is correct
29 Correct 53 ms 127044 KB Output is correct
30 Correct 50 ms 127128 KB Output is correct
31 Correct 49 ms 127124 KB Output is correct
32 Correct 50 ms 127044 KB Output is correct
33 Correct 50 ms 127044 KB Output is correct
34 Correct 51 ms 127136 KB Output is correct
35 Correct 57 ms 127076 KB Output is correct
36 Correct 55 ms 127100 KB Output is correct
37 Correct 49 ms 127056 KB Output is correct
38 Correct 49 ms 127040 KB Output is correct
39 Correct 51 ms 127040 KB Output is correct
40 Correct 51 ms 127044 KB Output is correct
41 Correct 53 ms 127040 KB Output is correct
42 Correct 57 ms 127088 KB Output is correct
43 Incorrect 659 ms 130512 KB Expected int32, but "1394132287329" found
44 Halted 0 ms 0 KB -