oj.uz

Submission #412475

# Submission time Handle Problem Language Result Execution time Memory
412475 2021-05-27T00:39:56 Z rqi Naan (JOI19_naan) C++14
29 / 100
 4000 ms 82172 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef vector<int> vi;
typedef long long ll;
 
#define pb push_back
 
const int MOD = 1e9+7;
const int mx = 2005;
 
 
ll GCD(ll a, ll b){
	a = abs(a); b = abs(b);
	if(a == 0) return b;
	if(b == 0) return a;
	return GCD(b%a, a);
}
 
struct frac{
	ll n, d;
	frac(){
		n = 0;
		d = 1;
	}
	frac(ll _n, ll _d){
		if(_d < 0){
			_n*=-1;
			_d*=-1;
		}
		assert(_d >= 1);
		ll g = GCD(_n, _d);
		n = _n/g;
		d = _d/g;
	}
	frac(ll _n){
		n = _n;
		d = 1;
	}
};
 
frac operator+(frac a, frac b){
	return frac(a.n*b.d+b.n*a.d, a.d*b.d);
}
 
frac& operator+=(frac& a, frac b){
	a = a+b;
	return a;
}
 
frac operator-(frac a, frac b){
	b.n*=-1;
	return a+b;
}
 
frac operator/(frac a, frac b){
	ll g_n = GCD(a.n, b.n);
	a.n/=g_n;
	b.n/=g_n;
	ll g_d = GCD(a.d, b.d);
	a.d/=g_d;
	b.d/=g_d;
	return frac(a.n*b.d, a.d*b.n);
}
 
void print(frac a){
	cout << a.n << "/" << a.d << " ";
}
 
bool isEqual(frac a, frac b){
	ll g_n = GCD(a.n, b.n);
	a.n/=g_n;
	b.n/=g_n;
	ll g_d = GCD(a.d, b.d);
	a.d/=g_d;
	b.d/=g_d;
	return a.n*b.d == b.n*a.d;
}
 
bool isLess(frac a, frac b){
	ll g_n = GCD(a.n, b.n);
	a.n/=g_n;
	b.n/=g_n;
	ll g_d = GCD(a.d, b.d);
	a.d/=g_d;
	b.d/=g_d;
	return a.n*b.d < b.n*a.d;
}
 
int N, L;
ll V[mx][mx];
frac poses[mx][mx]; //person i, j/N fraction
bool used[mx];
 
int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin >> N >> L;
	for(int i = 1; i <= N; i++){
		for(int j = 1; j <= L; j++){
			cin >> V[i][j];
		}
	}
 
	for(int i = 1; i <= N; i++){
		//cout << "i: " << i << "\n";
		ll weight_sum = 0;
		for(int j = 1; j <= L; j++){
			weight_sum+=V[i][j];
		}
		int cur_eaten = 0; //current prefix eaten
		frac cur_happy = frac(0);
		for(int j = 1; j <= N; j++){
			//cout << "j: " << j << "\n";
			while(cur_eaten+1 <= L){
 
				if(isLess(cur_happy+frac(V[i][cur_eaten+1], weight_sum), frac(j, N))){
					cur_happy+=frac(V[i][cur_eaten+1], weight_sum);
					cur_eaten++;
					// cout << "cur_eaten: " << cur_eaten << "\n";
					// print(cur_happy);
					// cout << "\n";
				}
				else{
					break;
				}
			}
			assert(cur_eaten < L);
			poses[i][j] = frac(cur_eaten)+(frac(j, N)-cur_happy)/(frac(V[i][cur_eaten+1], weight_sum));
		}
	}
 
	// for(int i = 1; i <= N; i++){
	// 	for(int j = 1; j <= N; j++){
	// 		cout << i << " " << j << " ";
	// 		print(poses[i][j]);
	// 		cout << "\n";
	// 	}
	// }
	vi perm;
	for(int i = 1; i <= N; i++){
		frac earliest = frac(MOD, 1);
		for(int j = 1; j <= N; j++){
			if(used[j]) continue; 
			if(isLess(poses[j][i], earliest)){
				earliest = poses[j][i];
			}
		}
		if(i <= N-1){
			cout << earliest.n << " " << earliest.d << "\n";
		}
		
		for(int j = 1; j <= N; j++){
			if(used[j]) continue; 
			if(isEqual(poses[j][i], earliest)){
				perm.pb(j);
				used[j] = 1;
				break;
			}
		}
	}
 
	for(auto u: perm){
		cout << u << " ";
	}
	cout << "\n";
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 63180 KB Output is correct
2 Correct 30 ms 63240 KB Output is correct
3 Correct 31 ms 63204 KB Output is correct
4 Correct 33 ms 63172 KB Output is correct
5 Correct 30 ms 63180 KB Output is correct
6 Correct 31 ms 63208 KB Output is correct
7 Correct 31 ms 63296 KB Output is correct
8 Correct 30 ms 63264 KB Output is correct
9 Correct 32 ms 63276 KB Output is correct
10 Correct 33 ms 63228 KB Output is correct
11 Correct 31 ms 63232 KB Output is correct
12 Correct 31 ms 63172 KB Output is correct
13 Correct 31 ms 63172 KB Output is correct
14 Correct 36 ms 63188 KB Output is correct
15 Correct 32 ms 63284 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 63180 KB Output is correct
2 Correct 31 ms 63308 KB Output is correct
3 Correct 33 ms 63248 KB Output is correct
4 Correct 33 ms 63264 KB Output is correct
5 Correct 38 ms 63300 KB Output is correct
6 Correct 31 ms 63272 KB Output is correct
7 Correct 31 ms 63204 KB Output is correct
8 Correct 33 ms 63268 KB Output is correct
9 Correct 36 ms 63300 KB Output is correct
10 Correct 32 ms 63280 KB Output is correct
11 Correct 34 ms 63304 KB Output is correct
12 Correct 30 ms 63248 KB Output is correct
13 Correct 32 ms 63296 KB Output is correct
14 Correct 34 ms 63332 KB Output is correct
15 Correct 32 ms 63288 KB Output is correct
16 Correct 34 ms 63308 KB Output is correct
17 Correct 33 ms 63324 KB Output is correct
18 Correct 34 ms 63348 KB Output is correct
19 Correct 33 ms 63356 KB Output is correct
20 Correct 34 ms 63308 KB Output is correct
21 Correct 34 ms 63308 KB Output is correct
22 Correct 33 ms 63368 KB Output is correct
23 Correct 30 ms 63152 KB Output is correct
24 Correct 34 ms 63232 KB Output is correct
25 Correct 31 ms 63184 KB Output is correct
26 Correct 31 ms 63284 KB Output is correct
27 Correct 32 ms 63276 KB Output is correct

Subtask #3
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 63180 KB Output is correct
2 Correct 30 ms 63240 KB Output is correct
3 Correct 31 ms 63204 KB Output is correct
4 Correct 33 ms 63172 KB Output is correct
5 Correct 30 ms 63180 KB Output is correct
6 Correct 31 ms 63208 KB Output is correct
7 Correct 31 ms 63296 KB Output is correct
8 Correct 30 ms 63264 KB Output is correct
9 Correct 32 ms 63276 KB Output is correct
10 Correct 33 ms 63228 KB Output is correct
11 Correct 31 ms 63232 KB Output is correct
12 Correct 31 ms 63172 KB Output is correct
13 Correct 31 ms 63172 KB Output is correct
14 Correct 36 ms 63188 KB Output is correct
15 Correct 32 ms 63284 KB Output is correct
16 Correct 30 ms 63180 KB Output is correct
17 Correct 31 ms 63308 KB Output is correct
18 Correct 33 ms 63248 KB Output is correct
19 Correct 33 ms 63264 KB Output is correct
20 Correct 38 ms 63300 KB Output is correct
21 Correct 31 ms 63272 KB Output is correct
22 Correct 31 ms 63204 KB Output is correct
23 Correct 33 ms 63268 KB Output is correct
24 Correct 36 ms 63300 KB Output is correct
25 Correct 32 ms 63280 KB Output is correct
26 Correct 34 ms 63304 KB Output is correct
27 Correct 30 ms 63248 KB Output is correct
28 Correct 32 ms 63296 KB Output is correct
29 Correct 34 ms 63332 KB Output is correct
30 Correct 32 ms 63288 KB Output is correct
31 Correct 34 ms 63308 KB Output is correct
32 Correct 33 ms 63324 KB Output is correct
33 Correct 34 ms 63348 KB Output is correct
34 Correct 33 ms 63356 KB Output is correct
35 Correct 34 ms 63308 KB Output is correct
36 Correct 34 ms 63308 KB Output is correct
37 Correct 33 ms 63368 KB Output is correct
38 Correct 30 ms 63152 KB Output is correct
39 Correct 34 ms 63232 KB Output is correct
40 Correct 31 ms 63184 KB Output is correct
41 Correct 31 ms 63284 KB Output is correct
42 Correct 32 ms 63276 KB Output is correct
43 Correct 566 ms 67568 KB Output is correct
44 Correct 3350 ms 82172 KB Output is correct
45 Correct 1396 ms 74072 KB Output is correct
46 Correct 170 ms 65092 KB Output is correct
47 Correct 2117 ms 78212 KB Output is correct
48 Execution timed out 4097 ms 77484 KB Time limit exceeded
49 Halted 0 ms 0 KB -