| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 929412 |
2024-02-18T05:27:49 Z |
Foolestboy |
Gap (APIO16_gap) |
C++14 |
|
42 ms |
3256 KB |
#ifndef GNORT
#include "gap.h"
#endif // GNORT
#include <bits/stdc++.h>
#define SQR(x) (1LL * ((x) * (x)))
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(s) (int)s.size()
#define prev __prev
#define next __next
#define left __left
#define right __right
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int ui;
using namespace std;
const int mod = 1e9 + 7;
const int INF = 1e9 + 7;
const ll INFLL = (ll)2e18 + 7LL;
const ld PI = acos(-1);
const int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
const int dy[] = {0, 0, 1, -1, -1, -1, 1, 1};
template<class BUI, class TRONG>
bool minimize(BUI &x, const TRONG y){
if(x > y){
x = y;
return true;
} else return false;
}
template<class BUI, class TRONG>
bool maximize(BUI &x, const TRONG y){
if(x < y){
x = y;
return true;
} else return false;
}
/* Author : Bui Nguyen Duc Trong, Luong Van Chanh High School for the gifted*/
/* Template is copied by Trong */
/** Losing in Provincial Contests **/
/** TRYING HARDER**/
/** ORZ **/
/* -----------------[ MAIN CODE GOES HERE ]----------------- */
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 1e5 + 10;
#ifdef GNORT
struct Jury{
int n, type;
ll a[N];
Jury() : n(0) {}
void init(){
cin >> type >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
}
void MinMax(ll s, ll t, ll *mn, ll *mx){
*mn = *mx = -1;
for(int i = 1; i <= n; i++){
if(a[i] >= s){
*mn = a[i];
break;
}
}
for(int i = n; i >= 1; i--){
if(a[i] <= t){
*mx = a[i];
break;
}
}
}
void check(ll ans){
ll res(0);
for(int i = 1; i < n; i++) maximize(res, a[i + 1] - a[i]);
if(ans == res) cout << "DUNG" << '\n';
else{
cout << "Jury: " << res << '\n';
cout << "Part: " << ans << '\n';
}
}
} jury;
void MinMax(ll s, ll t, ll *mn, ll *mx){
jury.MinMax(s, t, mn, mx);
}
void check(ll ans){
jury.check(ans);
}
#endif // GNORT
ll a[N];
ll findGap1(int n){
MinMax(0, (ll)1e18, &a[1], &a[n]);
for(int i = 2; i <= n - i + 1; i++){
MinMax(a[i - 1] + 1, a[n - i + 2] - 1, &a[i], &a[n - i + 1]);
}
ll ans = 0;
for(int i = 1; i < n; i++) maximize(ans, a[i + 1] - a[i]);
// check(ans);
return ans;
}
ll findGap2(int n){
return 0;
}
ll findGap(int type, int n){
return type == 1 ? findGap1(n) : findGap2(n);
}
/*
1 4
2 3 6 8
*/
#ifdef GNORT
void solve(){
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
const bool multitest = 0;
int tt = 1; if(multitest) cin >> tt;
while( tt-- ){
jury.init();
findGap(jury.type, jury.n);
}
return 0;
}
#endif
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2648 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2548 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 16 |
Correct |
8 ms |
2712 KB |
Output is correct |
| 17 |
Correct |
8 ms |
2588 KB |
Output is correct |
| 18 |
Correct |
10 ms |
2596 KB |
Output is correct |
| 19 |
Correct |
8 ms |
2700 KB |
Output is correct |
| 20 |
Correct |
6 ms |
2828 KB |
Output is correct |
| 21 |
Correct |
29 ms |
2972 KB |
Output is correct |
| 22 |
Correct |
31 ms |
3256 KB |
Output is correct |
| 23 |
Correct |
29 ms |
2884 KB |
Output is correct |
| 24 |
Correct |
31 ms |
2856 KB |
Output is correct |
| 25 |
Correct |
27 ms |
3256 KB |
Output is correct |
| 26 |
Correct |
31 ms |
2840 KB |
Output is correct |
| 27 |
Correct |
31 ms |
2904 KB |
Output is correct |
| 28 |
Correct |
33 ms |
2872 KB |
Output is correct |
| 29 |
Correct |
42 ms |
2844 KB |
Output is correct |
| 30 |
Correct |
24 ms |
2860 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
1 ms |
2392 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
2392 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 5 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 7 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 9 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 10 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 11 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 12 |
Incorrect |
1 ms |
2400 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 16 |
Incorrect |
4 ms |
2580 KB |
Output isn't correct |
| 17 |
Incorrect |
4 ms |
2596 KB |
Output isn't correct |
| 18 |
Incorrect |
4 ms |
2392 KB |
Output isn't correct |
| 19 |
Incorrect |
6 ms |
2588 KB |
Output isn't correct |
| 20 |
Incorrect |
4 ms |
2392 KB |
Output isn't correct |
| 21 |
Incorrect |
15 ms |
3032 KB |
Output isn't correct |
| 22 |
Incorrect |
15 ms |
2832 KB |
Output isn't correct |
| 23 |
Incorrect |
16 ms |
2884 KB |
Output isn't correct |
| 24 |
Incorrect |
15 ms |
2972 KB |
Output isn't correct |
| 25 |
Incorrect |
14 ms |
2848 KB |
Output isn't correct |
| 26 |
Incorrect |
14 ms |
2868 KB |
Output isn't correct |
| 27 |
Incorrect |
19 ms |
3108 KB |
Output isn't correct |
| 28 |
Incorrect |
14 ms |
3024 KB |
Output isn't correct |
| 29 |
Incorrect |
15 ms |
2880 KB |
Output isn't correct |
| 30 |
Incorrect |
9 ms |
2960 KB |
Output isn't correct |
| 31 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 32 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
