oj.uz

답안 #131852

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
131852 2019-07-17T19:50:21 Z hamzqq9 Naan (JOI19_naan) C++14
100 / 100
 1972 ms 96504 KB 
#include<bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define ii pair<int,int>
#define ll long long
#define orta ((bas+son)>>1)
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define inf 10000000000000
#define N 2019
#define MOD 998244353
using namespace std;
 
#define greater bos
 
struct frac {
 
	ll u,d;
 
};
 
frac mul(frac a,frac b) {
 
	ll u=(ll)a.u*b.u;
	ll d=(ll)a.d*b.d;
 
	ll g=__gcd(abs(u),abs(d));
 
	return {u/g,d/g};
 
}
 
frac dvd(frac a,frac b) {
 
	swap(b.u,b.d);
 
	return mul(a,b);
 
}
 
frac sub(frac a,frac b) {
 
	ll u=(ll)a.u*b.d-(ll)b.u*a.d;
	ll d=(ll)a.d*b.d;
 
	ll g=__gcd(abs(u),abs(d));
 
	return {u/g,d/g};
 
}
 
frac add(frac a,frac b) {
 
	ll u=(ll)a.u*b.d+(ll)b.u*a.d;
	ll d=(ll)a.d*b.d;
 
	ll g=__gcd(abs(u),abs(d));
 
	return {u/g,d/g};
 
}
 
bool eq(frac a,frac b) {
 
	return (ll)a.u*b.d==(ll)b.u*a.d;
 
}
 
bool greateq(frac a,frac b) {
	
	return 1.0*a.u/a.d>=1.0*b.u/b.d;
 
}
 
bool greater(frac a,frac b) {

	return 1.0*a.u/a.d>1.0*b.u/b.d;
 
}
 
frac gmin(frac a,frac b) {
 
	return greater(a,b)?b:a;	
 
}
 
int gnext(frac a) {
 
	return a.u/a.d+1;
 
}

frac app(frac a) {

	ll g=__gcd(abs(a.u),abs(a.d));

	return {a.u/g,a.d/g};

}
 
int n,l;
int v[N][N],pre[N][N],u[N],ptr[N];
frac req[N];
vector<frac> cp[N];
 
int main() {
 
	scanf("%d %d",&n,&l);
 
	for(int i=1;i<=n;i++) {
 
		req[i]={0,n};
 
		for(int j=1;j<=l;j++) {
 
			scanf("%d",&v[i][j]);

			pre[i][j]=pre[i][j-1]+v[i][j];
 
			req[i].u+=v[i][j];
 
		}
 
	}	
 
	for(int i=1;i<=n;i++) {
 
		cp[i].pb({0,1});

		for(int j=1;j<=n;j++) {

			int bas=1,son=l;

			while(bas<=son) {

				if((ll)pre[i][orta]*n<(ll)req[i].u*j) bas=orta+1;
				else son=orta-1;

			}

			// w==(j*sum-n*pre[i][son]+son*v[i][bas]*n)/v[i][bas]*n

			cp[i].pb(app({(ll)j*pre[i][l]-(ll)n*pre[i][son]+(ll)son*v[i][bas]*n,(ll)v[i][bas]*n}));

		}	
 
	}
 
	vector<frac> res;
	vector<int> ans;
 
	for(int i=1;i<=n;i++) {
 
		frac mn={inf,1};
		int tut=-1;
 
		for(int j=1;j<=n;j++) {
 
			if(u[j]) continue ;
 
			while(sz(res) && ptr[j]<n && greater(res.back(),cp[j][ptr[j]])) {
 
				++ptr[j];
 
			}
 
			if(ptr[j]<n) {
 
				if(greater(mn,cp[j][ptr[j]+1])) {
 
 					mn=cp[j][ptr[j]+1];
					tut=j;
 
				}
 
			}
 
		}
 
		ans.pb(tut);
		u[tut]=1;
 
		res.pb(mn);
 
	}
 
	res.ppb();
 
	for(auto x:res) printf("%lld %lld\n",x.u,x.d);
 
	for(auto x:ans) printf("%d ",x);
 
}

Compilation message

naan.cpp: In function 'int main()':
naan.cpp:110:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&l);
  ~~~~~^~~~~~~~~~~~~~~
naan.cpp:118:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&v[i][j]);
    ~~~~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
24.0 / 24.0

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

Subtask #3
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 3 ms 476 KB Output is correct
19 Correct 3 ms 504 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 2 ms 504 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 3 ms 504 KB Output is correct
25 Correct 3 ms 508 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 504 KB Output is correct
29 Correct 3 ms 504 KB Output is correct
30 Correct 3 ms 504 KB Output is correct
31 Correct 3 ms 504 KB Output is correct
32 Correct 3 ms 504 KB Output is correct
33 Correct 3 ms 504 KB Output is correct
34 Correct 3 ms 504 KB Output is correct
35 Correct 3 ms 508 KB Output is correct
36 Correct 3 ms 504 KB Output is correct
37 Correct 3 ms 504 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 3 ms 504 KB Output is correct
40 Correct 3 ms 504 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 3 ms 504 KB Output is correct
43 Correct 174 ms 14240 KB Output is correct
44 Correct 1035 ms 57040 KB Output is correct
45 Correct 381 ms 21812 KB Output is correct
46 Correct 36 ms 2552 KB Output is correct
47 Correct 613 ms 31788 KB Output is correct
48 Correct 1442 ms 82524 KB Output is correct
49 Correct 323 ms 25264 KB Output is correct
50 Correct 1730 ms 95204 KB Output is correct
51 Correct 601 ms 38160 KB Output is correct
52 Correct 1485 ms 80596 KB Output is correct
53 Correct 1322 ms 78548 KB Output is correct
54 Correct 3 ms 504 KB Output is correct
55 Correct 707 ms 49784 KB Output is correct
56 Correct 839 ms 52612 KB Output is correct
57 Correct 673 ms 47328 KB Output is correct
58 Correct 1213 ms 79744 KB Output is correct
59 Correct 667 ms 42412 KB Output is correct
60 Correct 1729 ms 96492 KB Output is correct
61 Correct 1774 ms 96320 KB Output is correct
62 Correct 1972 ms 96152 KB Output is correct
63 Correct 1842 ms 96392 KB Output is correct
64 Correct 1784 ms 96416 KB Output is correct
65 Correct 1867 ms 96504 KB Output is correct
66 Correct 1851 ms 96368 KB Output is correct
67 Correct 1686 ms 96460 KB Output is correct
68 Correct 724 ms 58248 KB Output is correct
69 Correct 676 ms 49204 KB Output is correct
70 Correct 901 ms 70592 KB Output is correct
71 Correct 1089 ms 71604 KB Output is correct