oj.uz

Submission #705889

# Submission time Handle Problem Language Result Execution time Memory
705889 2023-03-05T15:18:05 Z Alihan_8 Gap (APIO16_gap) C++17
0 / 100
 42 ms 1832 KB 
#include <bits/stdc++.h>
#include "gap.h"
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define int long long
long long findGap(int T, int N){
    int n = N;
	if ( T == 1 ){
        long long Mn = 0, Mx = 1e18+1, l = 0, r = n-1;
        vector <long long> res(n);
        while ( l <= r ){
            MinMax(Mn+1, Mx-1, &Mn, &Mx);
            res[l] = Mn, res[r] = Mx;
            l++, r--;
        }
        Mx = 0;
        for ( int i = 0; i+1 < n; i++ ){
            Mx = max(Mx, res[i+1]-res[i]);
        }
        return Mx;
	}
	return 0;
}
#if false
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n; cin >> n;
    vector <int> p(n);
    for ( auto &i: p ) cin >> i;
    cout << findGap(0, n);

    cout << '\n';
/*
4
2 3 6 8
*/
}
#endif

Compilation message

gap.cpp: In function 'void IO(std::string)':
gap.cpp:12:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
gap.cpp:12:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 10 ms 684 KB Output is correct
17 Correct 9 ms 592 KB Output is correct
18 Correct 9 ms 660 KB Output is correct
19 Correct 9 ms 588 KB Output is correct
20 Correct 7 ms 720 KB Output is correct
21 Correct 36 ms 1812 KB Output is correct
22 Correct 36 ms 1828 KB Output is correct
23 Correct 42 ms 1824 KB Output is correct
24 Correct 37 ms 1816 KB Output is correct
25 Correct 34 ms 1832 KB Output is correct
26 Correct 37 ms 1820 KB Output is correct
27 Correct 37 ms 1832 KB Output is correct
28 Correct 38 ms 1820 KB Output is correct
29 Correct 41 ms 1756 KB Output is correct
30 Correct 29 ms 1824 KB Output is correct
31 Incorrect 0 ms 208 KB Output isn't correct
32 Correct 1 ms 208 KB Output is correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Output isn't correct
2 Incorrect 1 ms 208 KB Output isn't correct
3 Incorrect 0 ms 208 KB Output isn't correct
4 Incorrect 0 ms 208 KB Output isn't correct
5 Incorrect 1 ms 208 KB Output isn't correct
6 Incorrect 0 ms 208 KB Output isn't correct
7 Incorrect 0 ms 208 KB Output isn't correct
8 Incorrect 0 ms 208 KB Output isn't correct
9 Incorrect 0 ms 208 KB Output isn't correct
10 Incorrect 0 ms 208 KB Output isn't correct
11 Incorrect 1 ms 208 KB Output isn't correct
12 Incorrect 1 ms 208 KB Output isn't correct
13 Incorrect 1 ms 336 KB Output isn't correct
14 Incorrect 1 ms 208 KB Output isn't correct
15 Incorrect 0 ms 208 KB Output isn't correct
16 Incorrect 5 ms 500 KB Output isn't correct
17 Incorrect 6 ms 512 KB Output isn't correct
18 Incorrect 5 ms 464 KB Output isn't correct
19 Incorrect 5 ms 424 KB Output isn't correct
20 Incorrect 3 ms 428 KB Output isn't correct
21 Incorrect 24 ms 968 KB Output isn't correct
22 Incorrect 18 ms 1060 KB Output isn't correct
23 Incorrect 18 ms 1064 KB Output isn't correct
24 Incorrect 17 ms 1048 KB Output isn't correct
25 Incorrect 15 ms 1056 KB Output isn't correct
26 Incorrect 20 ms 1020 KB Output isn't correct
27 Incorrect 20 ms 1052 KB Output isn't correct
28 Incorrect 20 ms 968 KB Output isn't correct
29 Incorrect 24 ms 1056 KB Output isn't correct
30 Incorrect 10 ms 976 KB Output isn't correct
31 Incorrect 0 ms 208 KB Output isn't correct
32 Incorrect 0 ms 208 KB Output isn't correct