oj.uz

답안 #292527

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
292527 2020-09-07T08:26:34 Z arnold518 Naan (JOI19_naan) C++14
100 / 100
 1805 ms 103544 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2000;

int N, L;
ll A[MAXN+10][MAXN+10];

struct Frac
{
	ll x, y;
	Frac() {}
	Frac(ll _x, ll _y)
	{
		x=_x; y=_y;
		norm();
	}
	void norm()
	{
		ll g=__gcd(x, y);
		x/=g; y/=g;
	}
};

bool operator >= (Frac p, Frac q) { p.norm(); q.norm(); return (__int128)p.y*q.x>=(__int128)q.y*p.x; }

Frac B[MAXN+10][MAXN+10];
bool vis[MAXN+10];
int ans[MAXN+10];

int main()
{
	scanf("%d%d", &N, &L);
	for(int i=1; i<=N; i++)
	{
		for(int j=1; j<=L; j++) scanf("%lld", &A[i][j]), A[i][j]+=A[i][j-1];
		for(int j=1, p=1; j<=N; j++)
		{
			for(; p<L && A[i][p]*N<=j*A[i][L]; p++);
			ll t=j*A[i][L]-N*A[i][p-1];
			B[i][j]=Frac(N*(A[i][p]-A[i][p-1]), (p-1)*N*(A[i][p]-A[i][p-1])+t);
			B[i][j].norm();
			//printf("(%lld %lld !%d) ", B[i][j].x, B[i][j].y, p);
		}
		//printf("\n");
	}

	for(int i=1; i<=N; i++)
	{
		Frac t; int val=-1;
		for(int j=1; j<=N; j++)
		{
			if(vis[j]) continue;
			if(val==-1 || t>=B[j][i]) val=j, t=B[j][i];
		}
		if(i<N) printf("%lld %lld\n", t.y, t.x);
		ans[i]=val;
		vis[val]=true;
	}
	for(int i=1; i<=N; i++) printf("%d ", ans[i]); printf("\n");
}

Compilation message

naan.cpp: In function 'int main()':
naan.cpp:64:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   64 |  for(int i=1; i<=N; i++) printf("%d ", ans[i]); printf("\n");
      |  ^~~
naan.cpp:64:49: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   64 |  for(int i=1; i<=N; i++) printf("%d ", ans[i]); printf("\n");
      |                                                 ^~~~~~
naan.cpp:37:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   37 |  scanf("%d%d", &N, &L);
      |  ~~~~~^~~~~~~~~~~~~~~~
naan.cpp:40:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   40 |   for(int j=1; j<=L; j++) scanf("%lld", &A[i][j]), A[i][j]+=A[i][j-1];
      |                           ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
24.0 / 24.0

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

Subtask #3
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 2 ms 512 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 2 ms 512 KB Output is correct
34 Correct 2 ms 512 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 2 ms 512 KB Output is correct
37 Correct 2 ms 512 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 2 ms 512 KB Output is correct
43 Correct 153 ms 11896 KB Output is correct
44 Correct 945 ms 54064 KB Output is correct
45 Correct 337 ms 28924 KB Output is correct
46 Correct 33 ms 4096 KB Output is correct
47 Correct 573 ms 42488 KB Output is correct
48 Correct 1416 ms 75384 KB Output is correct
49 Correct 312 ms 24056 KB Output is correct
50 Correct 1685 ms 95956 KB Output is correct
51 Correct 561 ms 41780 KB Output is correct
52 Correct 1394 ms 87068 KB Output is correct
53 Correct 1289 ms 80888 KB Output is correct
54 Correct 1 ms 384 KB Output is correct
55 Correct 671 ms 44152 KB Output is correct
56 Correct 778 ms 56600 KB Output is correct
57 Correct 629 ms 49476 KB Output is correct
58 Correct 1161 ms 78748 KB Output is correct
59 Correct 621 ms 46072 KB Output is correct
60 Correct 1510 ms 97124 KB Output is correct
61 Correct 1548 ms 96980 KB Output is correct
62 Correct 1774 ms 96792 KB Output is correct
63 Correct 1611 ms 97144 KB Output is correct
64 Correct 1558 ms 97212 KB Output is correct
65 Correct 1805 ms 103520 KB Output is correct
66 Correct 1786 ms 103544 KB Output is correct
67 Correct 1537 ms 103416 KB Output is correct
68 Correct 645 ms 60152 KB Output is correct
69 Correct 595 ms 56696 KB Output is correct
70 Correct 807 ms 72184 KB Output is correct
71 Correct 961 ms 82248 KB Output is correct