oj.uz

답안 #152252

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
152252 2019-09-07T00:32:26 Z username Naan (JOI19_naan) C++14
29 / 100
 716 ms 32468 KB 
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define int int_fast64_t
using namespace std;
typedef pair<int,int> pii;
#define REP(i,j,k) for(register int i=(j);i<(k);++i)
#define f first
#define s second
#define endl '\n'
#define IOS cin.tie(0),cout.tie(0),ios_base::sync_with_stdio(false)

const int maxn=2009;
int n,l,p[maxn],v[maxn][maxn];
bitset<maxn>us;

main(){
	IOS;
	cin>>n>>l;
	REP(i,0,n){
		v[i][0]=0;
		REP(j,0,l)cin>>v[i][j+1],v[i][j+1]+=v[i][j];
	}
	pii cur={0,1};
	REP(i,1,n){
		int opt=-1;
		pii ls={1,0};
		REP(j,0,n){
			if(us[j])continue;
			int k=cur.f/cur.s;
			pii t={v[j][k]*n*cur.s+(v[j][k+1]-v[j][k])*(cur.f%cur.s)*n+v[j][l]*cur.s,n*cur.s};
//			assert(v[j][k]*n*cur.s<7e18);
			while((__int128)v[j][k+1]*t.s<=t.f)++k;
			int vv=v[j][k+1]-v[j][k];
			t={k*vv*n+(((__int128)t.f)*n+t.s-1)/t.s-v[j][k]*n,vv*n};
			assert((((__int128)t.f)*n+t.s-1)/t.s<4e11);
//			assert((((__int128)t.f)*n+t.s-1)/t.s>=0);
			if((__int128)t.f*ls.s<(__int128)ls.f*t.s)opt=j,ls=t;
		}
		p[i]=opt;
		us[opt]=1;
		cur=ls;
		cout<<ls.f<<" "<<ls.s<<endl;
	}
	REP(i,1,n)cout<<p[i]+1<<" ";
	REP(i,0,n)if(!us[i])cout<<i+1<<endl;
}

Compilation message

naan.cpp:16:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^

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 376 KB Output is correct
4 Correct 3 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 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 3 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 3 ms 376 KB Output is correct
10 Correct 3 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 3 ms 504 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 3 ms 504 KB Output is correct
22 Correct 3 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 376 KB Output is correct
26 Correct 2 ms 504 KB Output is correct
27 Correct 3 ms 380 KB Output is correct

Subtask #3
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 376 KB Output is correct
4 Correct 3 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 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 3 ms 504 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 2 ms 376 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 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 3 ms 504 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 3 ms 504 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 504 KB Output is correct
34 Correct 3 ms 376 KB Output is correct
35 Correct 3 ms 504 KB Output is correct
36 Correct 3 ms 504 KB Output is correct
37 Correct 3 ms 376 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 376 KB Output is correct
41 Correct 2 ms 504 KB Output is correct
42 Correct 3 ms 380 KB Output is correct
43 Correct 51 ms 5368 KB Output is correct
44 Correct 345 ms 20860 KB Output is correct
45 Correct 174 ms 12668 KB Output is correct
46 Correct 25 ms 2424 KB Output is correct
47 Correct 232 ms 17288 KB Output is correct
48 Correct 344 ms 15736 KB Output is correct
49 Correct 96 ms 8344 KB Output is correct
50 Correct 501 ms 29464 KB Output is correct
51 Correct 207 ms 18040 KB Output is correct
52 Correct 459 ms 28832 KB Output is correct
53 Correct 391 ms 26124 KB Output is correct
54 Correct 3 ms 376 KB Output is correct
55 Correct 110 ms 7492 KB Output is correct
56 Correct 240 ms 21560 KB Output is correct
57 Correct 203 ms 19696 KB Output is correct
58 Correct 313 ms 24284 KB Output is correct
59 Correct 219 ms 19448 KB Output is correct
60 Incorrect 716 ms 32468 KB Integer parameter [name=A_i] equals to -3640678166, violates the range [1, 2000000000000]
61 Halted 0 ms 0 KB -