답안 #711230

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
711230 2023-03-16T10:48:40 Z youngyojun Naan (JOI19_naan) C++17
29 / 100
177 ms 67688 KB
#include <bits/stdc++.h>
#define fi first
#define se second
#define allv(V) (V).begin(),(V).end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
ll operator * (pll a, pll b) { return a.fi*b.se - a.se*b.fi; }

pll B[2005][2005];
ll A[2005];

int C[2005];

int N, L;

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);

	cin >> N >> L;
	for(int i = 0; i < N; i++) {
		for(int j = 0; j < L; j++) {
			ll x; cin >> x;
			A[j+1] = A[j] + x;
		}
		ll S = A[L];
		int k = 1, n = 0;
		while(k < N) {
			while(A[n+1]*N <= S*k) n++;
			ll u = S*k - A[n]*N, d = (A[n+1]-A[n])*N;
			B[i][k++] = {u + d*n, d};
		}
	}

	vector<int> V(N); iota(allv(V), 0);
	for(int k = 1; k < N; k++)
		swap(V[k-1], *min_element(k-1+allv(V), [&](int a, int b) {
			return B[a][k] * B[b][k] < 0;
		}));
	
	for(int k = 1; k < N; k++) {
		pll p = B[V[k-1]][k];
		cout << p.fi << ' ' << p.se << '\n';
	}
	for(int v : V) cout << v+1 << ' ';
	cout << '\n';

	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 368 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 368 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 37 ms 8988 KB Output is correct
44 Correct 159 ms 44832 KB Output is correct
45 Correct 109 ms 17932 KB Output is correct
46 Correct 15 ms 2088 KB Output is correct
47 Correct 121 ms 27420 KB Output is correct
48 Correct 93 ms 61008 KB Output is correct
49 Correct 36 ms 16572 KB Output is correct
50 Incorrect 177 ms 67688 KB X_i is not increasing
51 Halted 0 ms 0 KB -