oj.uz

Submission #138060

# Submission time Handle Problem Language Result Execution time Memory
138060 2019-07-29T08:43:53 Z ekrem Triple Jump (JOI19_jumps) C++
0 / 100
 81 ms 3808 KB 
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define coc g[node][i]
#define sol (k+k)
#define sag (k+k+1)
#define orta ((bas+son)>>1)
#define mod 1000000007
#define inf 1000000009
#define N 1000005

using namespace std;

typedef long long ll;
typedef pair < int , int > ii;
typedef vector < int > vi;

int n, m, ans;
ii a[N];

int main(){
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	scanf("%d",&n);
	for(int i = 1; i <= n; i++){
		scanf("%d",&a[i].st);
		a[i].nd = i;
	}
	sort(a + 1, a + n + 1);
	reverse(a + 1, a + n + 1);
	m = min(n, 100);
	for(int i = 1; i <= m; i++)
		for(int j = i + 1; j <= m; j++)
			for(int k = j + 1; k <= m; k++){
				vi x;
				x.pb(a[i].nd);
				x.pb(a[j].nd);
				x.pb(a[k].nd);
				sort(x.begin(), x.end());
				if(x[1] - x[0] <= x[2] - x[1])
					ans = max(ans, a[i].st + a[j].st + a[k].st);
			}
	printf("%d\n",ans);
	return 0;
}

Compilation message

jumps.cpp: In function 'int main()':
jumps.cpp:26:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
jumps.cpp:28:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i].st);
   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 26 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 26 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 1932 KB Output is correct
2 Correct 59 ms 3780 KB Output is correct
3 Correct 58 ms 3664 KB Output is correct
4 Correct 80 ms 3808 KB Output is correct
5 Correct 79 ms 3576 KB Output is correct
6 Incorrect 75 ms 3072 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 26 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -