Submission #375425

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
375425	2021-03-09T11:11:36 Z	casperwang	Naan (JOI19_naan)	C++14	5 / 100	82 ms	492 KB

naan

#include <bits/stdc++.h>
#define pii pair<int,int>
#define pdi pair<double,int>
#define ff first
#define ss second
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }

const int MAXN = 2000;
const int INF = 1e4;
const double eps = 1e-9;
int n, L;
int v[MAXN+1][MAXN+1];
int sum[MAXN+1];
double now;
int p[MAXN+1];
bool vis[MAXN+1];
pii ans[MAXN];

signed main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> L;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= L; j++) {
			cin >> v[i][j];
			sum[i] += v[i][j];
		}
	}
	for (int i = 1; i <= n; i++) {
		pdi mmin(INF, 0);
		for (int j = 1; j <= n; j++) {
			if (vis[j]) continue;
			double s = 0, k = (double) sum[j] / n;
			int id = ceil(now + eps);
			if ((id - now) * v[j][id] + s >= k) {
				mmin = min(mmin, pdi(now + (k - s) / v[j][id], j));
			} else {
				s += (id - now) * v[j][id];
				id++;
				while (true) {
					if (v[j][id] + s >= k) {
						mmin = min(mmin, pdi(id-1 + (k - s) / v[j][id], j));
						break;
					} else {
						s += v[j][id];
						id++;
					}
				}
			}
		}
		p[i] = mmin.ss;
		vis[mmin.ss] = true;
		now = mmin.ff;
		if (i < n)
			ans[i] = pii(now * INF, INF);
	}
	for (int i = 1; i < n; i++)
		cout << ans[i].ff << ' ' << ans[i].ss << '\n';
	for (int i = 1; i <= n; i++)
		cout << p[i] << " \n"[i==n];
	return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	492 KB	Output is correct
14	Correct	2 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	77 ms	392 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	2 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	82 ms	492 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Incorrect	9 ms	492 KB	Integer parameter [name=P_i] equals to 0, violates the range [1, 5]

Subtask #3
0 / 71.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	492 KB	Output is correct
29	Correct	2 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	77 ms	392 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	2 ms	364 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	82 ms	492 KB	Output is correct
37	Correct	1 ms	364 KB	Output is correct
38	Correct	1 ms	364 KB	Output is correct
39	Correct	1 ms	364 KB	Output is correct
40	Correct	1 ms	364 KB	Output is correct
41	Correct	1 ms	364 KB	Output is correct
42	Incorrect	9 ms	492 KB	Integer parameter [name=P_i] equals to 0, violates the range [1, 5]

Submission #375425

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 0 / 24.0

Subtask #3 0 / 71.0

Subtask #1
5.0 / 5.0

Subtask #2
0 / 24.0

Subtask #3
0 / 71.0