oj.uz

Submission #203717

# Submission time Handle Problem Language Result Execution time Memory
203717 2020-02-22T00:56:26 Z ics0503 Naan (JOI19_naan) C++17
29 / 100
 146 ms 20344 KB 
#include<stdio.h>
#include<vector>
#include<set>
using namespace std;
set<long long >people;
long long v[2121][2121], S[2121][2121];
struct xy {
	long long x, y;
}need[2121];
long long gcd(long long a, long long b) {
	if (b == 0)return a;
	return gcd(b, a%b);
}
struct xyz {
	long long x, y, z;
	void balance() {
		long long g = gcd(y, z);
		y /= g; z /= g;
	}
}L[2121][2121];
bool cmp(xyz a, xyz b) {
	if (a.x != b.x) return a.x < b.x;
	return a.y * b.z < b.y * a.z;
}
vector<int>ans;
int main() {
	int n, l, i, j; scanf("%d%d", &n, &l);
	for (i = 1; i <= n; i++)people.insert(i);
	for (i = 1; i <= n; i++) {
		L[i][0] = { 1,0,1 };
		for (j = 1; j <= l; j++)scanf("%lld", &v[i][j]), S[i][j] = S[i][j - 1] + v[i][j],need[i].x+=v[i][j];
		need[i].y = n;
		for (j = 1; j < n; j++) {
			long long befa = L[i][j - 1].x, befx = L[i][j - 1].y, befy = L[i][j - 1].z;
			if ((befy - befx) * v[i][befa] * need[i].y > need[i].x * befy) {
				L[i][j].x = befa;
				L[i][j].y = need[i].x*befy + befx*need[i].y*v[i][befa];
				L[i][j].z = need[i].y*v[i][befa] * befy;
				L[i][j].balance();
			}
			else {
				while (L[i][j].x<l && (befy - befx) * v[i][befa] * need[i].y + (S[i][L[i][j].x] - S[i][befa]) * befy * need[i].y <= need[i].x * befy) {
					L[i][j].x++;
				}
				L[i][j].y = need[i].x*befy
					- (befy - befx)*v[i][befa] * need[i].y
					- (S[i][L[i][j].x - 1] - S[i][befa]) * befy * need[i].y;
				L[i][j].z = v[i][L[i][j].x] * need[i].y * befy;
				L[i][j].balance();
			}
		}
	}
	for (i = 1; i < n; i++) {
		xyz mn = { l + 1,0,1 }; long long mnw = 0;
		for (long long who : people) {
			if (cmp(L[who][i], mn)) {
				mn = L[who][i];
				mnw = who;
			}
		}
		printf("%lld %lld\n", (mn.x - 1)*mn.z + mn.y, mn.z);
		people.erase(mnw); ans.push_back(mnw);
	}
	for (int i = 0; i < ans.size(); i++)printf("%d ", ans[i]);
	printf("%lld", *people.begin());
	return 0;
}

Compilation message

naan.cpp: In function 'int main()':
naan.cpp:64:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < ans.size(); i++)printf("%d ", ans[i]);
                  ~~^~~~~~~~~~~~
naan.cpp:27:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int n, l, i, j; scanf("%d%d", &n, &l);
                  ~~~~~^~~~~~~~~~~~~~~~
naan.cpp:31:83: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   for (j = 1; j <= l; j++)scanf("%lld", &v[i][j]), S[i][j] = S[i][j - 1] + v[i][j],need[i].x+=v[i][j];
                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 6 ms 380 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 6 ms 504 KB Output is correct
5 Correct 6 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 6 ms 380 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 6 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 6 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 504 KB Output is correct
15 Correct 6 ms 504 KB Output is correct
16 Correct 6 ms 632 KB Output is correct
17 Correct 6 ms 504 KB Output is correct
18 Correct 6 ms 632 KB Output is correct
19 Correct 6 ms 504 KB Output is correct
20 Correct 6 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 6 ms 504 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
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 380 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 6 ms 376 KB Output is correct
13 Correct 6 ms 380 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 504 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 6 ms 504 KB Output is correct
20 Correct 6 ms 504 KB Output is correct
21 Correct 5 ms 504 KB Output is correct
22 Correct 6 ms 380 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 6 ms 504 KB Output is correct
25 Correct 6 ms 504 KB Output is correct
26 Correct 6 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 504 KB Output is correct
30 Correct 6 ms 504 KB Output is correct
31 Correct 6 ms 632 KB Output is correct
32 Correct 6 ms 504 KB Output is correct
33 Correct 6 ms 632 KB Output is correct
34 Correct 6 ms 504 KB Output is correct
35 Correct 6 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 6 ms 504 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 146 ms 20344 KB Output is correct
44 Runtime error 18 ms 1272 KB Execution killed with signal 8 (could be triggered by violating memory limits)
45 Halted 0 ms 0 KB -