oj.uz

Submission #560578

# Submission time Handle Problem Language Result Execution time Memory
560578 2022-05-11T17:20:42 Z blue Naan (JOI19_naan) C++17
29 / 100
 105 ms 64032 KB 
#include <iostream>
#include <vector>
#include <cassert>
using namespace std;
 
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vi = vector<int>;
 
const ll mx = 2'000;
 
int N, L;

ll getgcd(ll a, ll b)
{
	while(1)
	{
		if(a < b)
			swap(a, b);

		if(b == 0)
			return a;

		a = a % b;
	}
}
 
struct frac
{
	ll n;
	ll d;
};


frac makegood(ll n, ll d)
{
	if(d < 0)
	{
		n = -n;
		d = -d;
	}

	ll g = getgcd(max(n, -n), d);

	return frac{n/g, d/g};
}
 
bool operator < (frac A, frac B)
{
	return A.n*B.d < B.n*A.d;
}
 
bool operator == (frac A, frac B)
{
	return A.n*B.d == B.n*A.d;
}
 
bool operator > (frac A, frac B)
{
	return B < A;
}
 
bool operator <= (frac A, frac B)
{
	return A.n*B.d <= B.n*A.d;
}
 
frac operator + (frac A, frac B)
{
	return makegood(A.n*B.d + B.n*A.d, A.d*B.d);
}
 
frac operator - (frac A, frac B)
{
	return makegood(A.n*B.d - B.n*A.d, A.d*B.d);
}
 
frac operator / (frac A, frac B)
{
	return makegood(A.n*B.d, B.n*A.d);
}
 
vvll V(1+mx, vll(1+mx, 0));
 
frac getVpref(int p, frac i)
{
	if(i.n == i.d * L)
		return {V[p][L], 1};
	// return V[p][i.n/i.d] + (V[i.n/i.d + 1] - V[i.n/i.d]) * ((i.n % i.d) / i.d);
 
	return frac{V[p][i.n/i.d]*i.d + (V[p][i.n/i.d + 1] - V[p][i.n/i.d]) * (i.n % i.d), i.d};
}
 
int main()
{
	cin >> N >> L;
 
	for(int i = 1; i <= N; i++)
	{
		for(int j = 1; j <= L; j++)
		{
			cin >> V[i][j];
			V[i][j] += V[i][j-1];
		}
	}
 
	vi visit(1+N, 0);
 
	vector<frac> X;
	vector<int> P;
 
	X.push_back({0, 1});
 
	vector<frac> curr(1+N, frac{0, 1});
 
	int xct = 0;
 


	for(int t = 1; t < N; t++)
	{
		// cerr << "\n\n";
		// cerr << "t = " << t << '\n';
		int bestp = -1;
		for(int i = 1; i <= N; i++)
		{
			if(visit[i]) continue;

			assert(0 <= curr[i].n);
 
			while(getVpref(i, curr[i]) < getVpref(i, X.back()) + frac{V[i][L], N})
			{
				xct++;
				// if(xct >= 50'000'000)
				// 	assert(0);
				if(curr[i].d == 1)
				{
					if(curr[i].n < L && frac{V[i][curr[i].n + 1], 1} <= getVpref(i, X.back()) + frac{V[i][L], N})
						curr[i].n++;
					else
					{
						frac thisfrac = (getVpref(i, X.back()) + frac{V[i][L], N} - getVpref(i, curr[i])) / frac{V[i][curr[i].n + 1] - V[i][curr[i].n], 1};
						curr[i] = curr[i] + thisfrac;
						break;
					}
				}
				else
				{
					// assert(curr[i].d != 0);
					curr[i] = frac{min(curr[i].n / curr[i].d + 1, ll(L)), 1};
					// assert(-1000000000 <= curr[i].n);
					if(getVpref(i, curr[i]) > getVpref(i, X.back()) + frac{V[i][L], N})
					{
						// assert(curr[i].n >= 1);
						curr[i] = curr[i] - (getVpref(i, curr[i]) - (getVpref(i, X.back()) + frac{V[i][L], N})) / frac{V[i][curr[i].n]  - V[i][curr[i].n - 1], 1};
					}
				}
			}
 
			if(bestp == -1 || curr[bestp] > curr[i])
				bestp = i;
			// cerr << i << " : " << curr[i].n << ' ' << curr[i].d << '\n';
		}
 
		visit[bestp] = 1;
		P.push_back(bestp);
		X.push_back(curr[bestp]);
	}
	// assert(N <= 6);
 
	for(int i = 1; i <= N; i++)
		if(!visit[i])
			P.push_back(i);
 
 
	for(int i = 1; i <= N-1; i++)
		cout << X[i].n << ' ' << X[i].d << '\n';
	for(int p : P)
		cout << p << ' ';
	cout << '\n';
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 31684 KB Output is correct
2 Correct 16 ms 31784 KB Output is correct
3 Correct 15 ms 31676 KB Output is correct
4 Correct 15 ms 31700 KB Output is correct
5 Correct 15 ms 31616 KB Output is correct
6 Correct 14 ms 31700 KB Output is correct
7 Correct 14 ms 31700 KB Output is correct
8 Correct 14 ms 31708 KB Output is correct
9 Correct 14 ms 31700 KB Output is correct
10 Correct 16 ms 31696 KB Output is correct
11 Correct 16 ms 31672 KB Output is correct
12 Correct 16 ms 31700 KB Output is correct
13 Correct 14 ms 31600 KB Output is correct
14 Correct 14 ms 31596 KB Output is correct
15 Correct 15 ms 31700 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 31700 KB Output is correct
2 Correct 15 ms 31700 KB Output is correct
3 Correct 16 ms 31600 KB Output is correct
4 Correct 17 ms 31700 KB Output is correct
5 Correct 17 ms 31604 KB Output is correct
6 Correct 15 ms 31700 KB Output is correct
7 Correct 16 ms 31660 KB Output is correct
8 Correct 14 ms 31700 KB Output is correct
9 Correct 17 ms 31592 KB Output is correct
10 Correct 15 ms 31700 KB Output is correct
11 Correct 15 ms 31676 KB Output is correct
12 Correct 15 ms 31704 KB Output is correct
13 Correct 16 ms 31716 KB Output is correct
14 Correct 17 ms 31632 KB Output is correct
15 Correct 17 ms 31660 KB Output is correct
16 Correct 17 ms 31640 KB Output is correct
17 Correct 17 ms 31628 KB Output is correct
18 Correct 16 ms 31700 KB Output is correct
19 Correct 16 ms 31628 KB Output is correct
20 Correct 16 ms 31700 KB Output is correct
21 Correct 15 ms 31700 KB Output is correct
22 Correct 18 ms 31688 KB Output is correct
23 Correct 15 ms 31608 KB Output is correct
24 Correct 15 ms 31700 KB Output is correct
25 Correct 16 ms 31676 KB Output is correct
26 Correct 16 ms 31700 KB Output is correct
27 Correct 16 ms 31708 KB Output is correct

Subtask #3
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 31684 KB Output is correct
2 Correct 16 ms 31784 KB Output is correct
3 Correct 15 ms 31676 KB Output is correct
4 Correct 15 ms 31700 KB Output is correct
5 Correct 15 ms 31616 KB Output is correct
6 Correct 14 ms 31700 KB Output is correct
7 Correct 14 ms 31700 KB Output is correct
8 Correct 14 ms 31708 KB Output is correct
9 Correct 14 ms 31700 KB Output is correct
10 Correct 16 ms 31696 KB Output is correct
11 Correct 16 ms 31672 KB Output is correct
12 Correct 16 ms 31700 KB Output is correct
13 Correct 14 ms 31600 KB Output is correct
14 Correct 14 ms 31596 KB Output is correct
15 Correct 15 ms 31700 KB Output is correct
16 Correct 14 ms 31700 KB Output is correct
17 Correct 15 ms 31700 KB Output is correct
18 Correct 16 ms 31600 KB Output is correct
19 Correct 17 ms 31700 KB Output is correct
20 Correct 17 ms 31604 KB Output is correct
21 Correct 15 ms 31700 KB Output is correct
22 Correct 16 ms 31660 KB Output is correct
23 Correct 14 ms 31700 KB Output is correct
24 Correct 17 ms 31592 KB Output is correct
25 Correct 15 ms 31700 KB Output is correct
26 Correct 15 ms 31676 KB Output is correct
27 Correct 15 ms 31704 KB Output is correct
28 Correct 16 ms 31716 KB Output is correct
29 Correct 17 ms 31632 KB Output is correct
30 Correct 17 ms 31660 KB Output is correct
31 Correct 17 ms 31640 KB Output is correct
32 Correct 17 ms 31628 KB Output is correct
33 Correct 16 ms 31700 KB Output is correct
34 Correct 16 ms 31628 KB Output is correct
35 Correct 16 ms 31700 KB Output is correct
36 Correct 15 ms 31700 KB Output is correct
37 Correct 18 ms 31688 KB Output is correct
38 Correct 15 ms 31608 KB Output is correct
39 Correct 15 ms 31700 KB Output is correct
40 Correct 16 ms 31676 KB Output is correct
41 Correct 16 ms 31700 KB Output is correct
42 Correct 16 ms 31708 KB Output is correct
43 Runtime error 105 ms 64032 KB Execution killed with signal 8
44 Halted 0 ms 0 KB -