oj.uz

Submission #230417

# Submission time Handle Problem Language Result Execution time Memory
230417 2020-05-10T06:10:39 Z kartel Pismo (COCI18_pismo) C++14
40 / 70
 6 ms 896 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +8005
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

ll ans, a[N], i, n;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n;
    for (i = 1; i <= n; i++) cin >> a[i];
    ans = 1e18;
    for (i = 2; i <= n; i++) ans = min(ans, abs(a[i - 1] - a[i]));
    cout << ans;
}

Subtask #1
40.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Runtime error 6 ms 896 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 6 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 6 ms 896 KB Execution killed with signal 11 (could be triggered by violating memory limits)