oj.uz

답안 #223140

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
223140 2020-04-14T23:41:35 Z AQT Naan (JOI19_naan) C++14
29 / 100
 42 ms 8952 KB 
#include <bits/stdc++.h>

using namespace std;

int N, L;
long long arr[2005][2005];
long long pre[2005][2005];
long long tar[2005];
bool done[2005];
vector<int> perm;
vector<long long> val;

long long calc(long long l, long long r, int idx){
	long long lblk = l/1000000000+1;
	long long rblk = r/1000000000;
	long long ret = pre[idx][rblk] - pre[idx][lblk];
	ret += arr[idx][rblk+1] * (r%1000000000);
	ret += arr[idx][lblk] * (1000000000 - l%1000000000);
	return ret;
}

int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> N >> L;
	for(int i = 1; i<=N; i++){
		for(int l = 1; l<=L; l++){
			cin >> arr[i][l];
			tar[i] += arr[i][l] * 1000000000;
			pre[i][l] = pre[i][l-1] + arr[i][l] * 1000000000;
		}
		tar[i];
		tar[i] /= N;
	}
	long long lst = 0;
	for(int t = 1; t<N; t++){
		long long bst = L*1000000000LL, idx = 0;
		for(int i = 1; i<=N; i++){
			if(!done[i]){
				long long l = lst+1, r = bst;
				if(calc(lst, bst, i) < tar[i]){
					continue;
				}
				while(l <= r){
					long long mid = l+r>>1;
					if(calc(lst, mid, i) >= tar[i]){
						bst = mid;
						r = mid - 1;
						idx = i;
					}
					else{
						l = mid + 1;
					}
				}
			}
		}
		perm.push_back(idx);
		val.push_back(bst);
		lst = bst;
		done[idx] = 1;
	}
	for(int i = 1; i<=N; i++){
		if(!done[i]){
			perm.push_back(i);
		}
	}
	for(int i = 1; i<N; i++){
		cout << val[i-1] << " " << 1000000000 << "\n";
	}
	for(int i = 1; i<=N; i++){
		cout << perm[i-1] << " ";
	}
}

Compilation message

naan.cpp: In function 'int main()':
naan.cpp:33:8: warning: statement has no effect [-Wunused-value]
   tar[i];
   ~~~~~^
naan.cpp:46:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
      long long mid = l+r>>1;
                      ~^~

Subtask #1
5.0 / 5.0

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

Subtask #2
24.0 / 24.0

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

Subtask #3
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 5 ms 512 KB Output is correct
35 Correct 5 ms 512 KB Output is correct
36 Correct 5 ms 512 KB Output is correct
37 Correct 5 ms 512 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 5 ms 512 KB Output is correct
40 Correct 5 ms 512 KB Output is correct
41 Correct 5 ms 384 KB Output is correct
42 Correct 5 ms 512 KB Output is correct
43 Incorrect 42 ms 8952 KB Not a fair distribution.
44 Halted 0 ms 0 KB -