oj.uz

답안 #201269

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201269 2020-02-10T05:31:58 Z dimash241 Naan (JOI19_naan) C++17
100 / 100
 880 ms 138872 KB 
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")

//# include <x86intrin.h>
# include <bits/stdc++.h>

# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;
 
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 2123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
using pt = pair<ll, ll>; 
int n, m, k;
ll a[2020][2020];
ll pref[2020][2020];
ll s[2020];
vector < pt > ans;
bool u[N];
vector < int > ord;
int p[N];
pt reduc(pt a) {
	ll g = __gcd(a.F, a.S);
	a.F /= g;
	a.S /= g;
	return a;
}
pt val[N][N];

bool cmp (pt a, pt b) {
	return a.first * (ld)b.second < b.first * (ld)a.second;
}

int main () {
   	SpeedForce;
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			cin >> a[i][j], s[i] += a[i][j];
			pref[i][j] = s[i];
		}
	}
	for (int i = 1; i <= n; i ++) {
		
		int ptr = 0;
		val[i][0] = {0, 1};
		ll cur = 0;

		for (int j = 1; j < n; ++j) {
			while (cur + a[i][ptr + 1] * (ll)n <= s[i] * j) {
				cur += a[i][++ptr] * (ll)n;

			}

			ll diff = s[i] * j - cur;
			pt fr = {diff, a[i][ptr + 1] * n};
			fr.F += ptr * (ll)n * a[i][ptr + 1];
			val[i][j] = reduc(fr);
		}
		val[i][n] = mp(m, 1);
	}	

	for (int i = 1; i < n; ++i) {
		int pos = 1;
		while (u[pos]) ++pos;
		for (int j = pos + 1; j <= n; ++j) if (!u[j] && cmp(val[j][i], val[pos][i])) {
			pos = j;
		}
		u[pos] = 1;
		ord.pb(pos);
		
		ans.pb(val[pos][i]);
		
	}
	for (int i = 1; i <= n; i ++) if (!u[i]) ord.pb(i);

	for (auto it : ans) cout << it.F << ' ' << it.S << '\n';
	for (auto it : ord) cout << it << ' ';
	cout << '\n';

   	return Accepted;
}

// B...a

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 504 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 424 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 6 ms 632 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 6 ms 632 KB Output is correct
10 Correct 6 ms 632 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 6 ms 632 KB Output is correct
15 Correct 6 ms 632 KB Output is correct
16 Correct 6 ms 632 KB Output is correct
17 Correct 6 ms 632 KB Output is correct
18 Correct 6 ms 632 KB Output is correct
19 Correct 6 ms 632 KB Output is correct
20 Correct 5 ms 504 KB Output is correct
21 Correct 6 ms 632 KB Output is correct
22 Correct 6 ms 632 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 508 KB Output is correct
25 Correct 5 ms 504 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 6 ms 504 KB Output is correct

Subtask #3
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 504 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 6 ms 424 KB Output is correct
17 Correct 5 ms 504 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 5 ms 632 KB Output is correct
20 Correct 5 ms 504 KB Output is correct
21 Correct 6 ms 632 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 504 KB Output is correct
24 Correct 6 ms 632 KB Output is correct
25 Correct 6 ms 632 KB Output is correct
26 Correct 5 ms 504 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 504 KB Output is correct
29 Correct 6 ms 632 KB Output is correct
30 Correct 6 ms 632 KB Output is correct
31 Correct 6 ms 632 KB Output is correct
32 Correct 6 ms 632 KB Output is correct
33 Correct 6 ms 632 KB Output is correct
34 Correct 6 ms 632 KB Output is correct
35 Correct 5 ms 504 KB Output is correct
36 Correct 6 ms 632 KB Output is correct
37 Correct 6 ms 632 KB Output is correct
38 Correct 5 ms 376 KB Output is correct
39 Correct 5 ms 508 KB Output is correct
40 Correct 5 ms 504 KB Output is correct
41 Correct 5 ms 376 KB Output is correct
42 Correct 6 ms 504 KB Output is correct
43 Correct 80 ms 17784 KB Output is correct
44 Correct 466 ms 82936 KB Output is correct
45 Correct 211 ms 39928 KB Output is correct
46 Correct 33 ms 6008 KB Output is correct
47 Correct 313 ms 57524 KB Output is correct
48 Correct 558 ms 93180 KB Output is correct
49 Correct 138 ms 31608 KB Output is correct
50 Correct 714 ms 127224 KB Output is correct
51 Correct 278 ms 58364 KB Output is correct
52 Correct 629 ms 114428 KB Output is correct
53 Correct 552 ms 105464 KB Output is correct
54 Correct 5 ms 504 KB Output is correct
55 Correct 281 ms 50936 KB Output is correct
56 Correct 366 ms 77048 KB Output is correct
57 Correct 298 ms 67448 KB Output is correct
58 Correct 504 ms 101112 KB Output is correct
59 Correct 308 ms 63992 KB Output is correct
60 Correct 799 ms 134320 KB Output is correct
61 Correct 808 ms 134264 KB Output is correct
62 Correct 880 ms 133984 KB Output is correct
63 Correct 849 ms 134136 KB Output is correct
64 Correct 803 ms 134264 KB Output is correct
65 Correct 783 ms 138872 KB Output is correct
66 Correct 818 ms 138872 KB Output is correct
67 Correct 738 ms 138872 KB Output is correct
68 Correct 303 ms 78712 KB Output is correct
69 Correct 306 ms 76408 KB Output is correct
70 Correct 379 ms 92424 KB Output is correct
71 Correct 477 ms 107640 KB Output is correct