답안 #61137

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61137 2018-07-25T08:38:23 Z dukati8 Gap (APIO16_gap) C++14
30 / 100
94 ms 4692 KB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i=a; i<int(b); i++)

long long findGap(int T, int N)
{
	if (T==1) {
		vector<long long> vals;
		long long hi=1e18;
		long long lo=0;
		long long ans1,ans2;
		rep (i,0,(N+1)/2) {
			assert(lo<=hi);
			MinMax(lo,hi,&ans1,&ans2);
			vals.push_back(ans1);
			vals.push_back(ans2);
			lo=ans1+1;
			hi=ans2-1;
		}
		sort(vals.begin(),vals.end());
		long long maxdist=0;
		rep (i,0,vals.size()-1) {
			maxdist=max(maxdist,vals[i+1]-vals[i]);
			//cout << maxdist << endl;
		}
		return maxdist;
	}
	if (T==2) {
		long long NL=N;
		long long one=1;
		vector<long long> vals;
		long long hi,lo;
		MinMax(0,1e18,&lo,&hi);
		//Vi har nu max och min för alla tal.
		long long expdist=(hi-lo)/(NL-one);
		vals.push_back(hi);
		vals.push_back(lo);
		rep (i,0,N-1) {
			long long start,stop;
			start=lo+one+(i*(hi-lo))/(NL-one);
			stop=lo+((i+one)*(hi-lo))/(NL-one);
			assert(start<=stop);
			long long ans1,ans2;
			MinMax(start,stop,&ans1,&ans2);
			if (ans1!=-1) vals.push_back(ans1);
			if (ans2!=-1) vals.push_back(ans2);
		}
		sort(vals.begin(),vals.end());
		long long maxdist=0;
		rep (i,0,vals.size()-1) maxdist=max(maxdist,vals[i+1]-vals[i]);
		//assert(maxdist>=expdist);
		return maxdist;
	}

}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:36:13: warning: unused variable 'expdist' [-Wunused-variable]
   long long expdist=(hi-lo)/(NL-one);
             ^~~~~~~
gap.cpp:56:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 4 ms 432 KB Output is correct
5 Correct 1 ms 508 KB Output is correct
6 Correct 3 ms 584 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 3 ms 616 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 4 ms 620 KB Output is correct
12 Correct 5 ms 620 KB Output is correct
13 Correct 4 ms 640 KB Output is correct
14 Correct 4 ms 640 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 23 ms 1132 KB Output is correct
17 Correct 20 ms 1224 KB Output is correct
18 Correct 17 ms 1224 KB Output is correct
19 Correct 19 ms 1224 KB Output is correct
20 Correct 15 ms 1224 KB Output is correct
21 Correct 70 ms 2528 KB Output is correct
22 Correct 70 ms 2532 KB Output is correct
23 Correct 90 ms 2532 KB Output is correct
24 Correct 67 ms 2532 KB Output is correct
25 Correct 62 ms 2532 KB Output is correct
26 Correct 81 ms 2532 KB Output is correct
27 Correct 71 ms 2532 KB Output is correct
28 Correct 69 ms 2532 KB Output is correct
29 Correct 73 ms 2536 KB Output is correct
30 Correct 65 ms 2536 KB Output is correct
31 Correct 3 ms 2536 KB Output is correct
32 Correct 3 ms 2536 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2536 KB Output is correct
2 Runtime error 3 ms 2536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Runtime error 5 ms 2536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Runtime error 3 ms 2536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Correct 3 ms 2536 KB Output is correct
6 Runtime error 5 ms 2536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 4 ms 2536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 3 ms 2536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 3 ms 2536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Correct 3 ms 2536 KB Output is correct
11 Runtime error 4 ms 2536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Runtime error 3 ms 2536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Runtime error 4 ms 2536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Runtime error 4 ms 2536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Correct 4 ms 2536 KB Output is correct
16 Runtime error 12 ms 2536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Runtime error 18 ms 2536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Runtime error 13 ms 2536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
19 Runtime error 12 ms 2536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Correct 12 ms 2536 KB Output is correct
21 Runtime error 47 ms 2536 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Runtime error 44 ms 2568 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Runtime error 49 ms 2568 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Runtime error 40 ms 2568 KB Execution killed with signal 11 (could be triggered by violating memory limits)
25 Correct 94 ms 4692 KB Output is correct
26 Runtime error 49 ms 4692 KB Execution killed with signal 11 (could be triggered by violating memory limits)
27 Runtime error 43 ms 4692 KB Execution killed with signal 11 (could be triggered by violating memory limits)
28 Runtime error 36 ms 4692 KB Execution killed with signal 11 (could be triggered by violating memory limits)
29 Runtime error 39 ms 4692 KB Execution killed with signal 11 (could be triggered by violating memory limits)
30 Correct 52 ms 4692 KB Output is correct
31 Runtime error 4 ms 4692 KB Execution killed with signal 11 (could be triggered by violating memory limits)
32 Runtime error 3 ms 4692 KB Execution killed with signal 11 (could be triggered by violating memory limits)