oj.uz

답안 #987266

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987266 2024-05-22T13:29:38 Z 0pt1mus23 Pismo (COCI18_pismo) C++14
70 / 70
 9 ms 1884 KB 
#pragma GCC optimize("O3","inline")
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(),v.end()
#define ins insert
#define pb push_back
#define int long long
#define pii pair<int,int>
#define endl '\n'
#define drop(x) cout<<(x)<<endl;return;
#define reach cerr<<"reached >.<!"<<endl;
/*
    m : 11059739 -> l ~23
    p : 4567896467
*/
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const int mod =  1e9 +7, sze=2e5 +5,inf=LLONG_MAX, prime = 2333;

//\\
:pepeblacklove:  :dp/st/sp/bs/gr: :pepeblacklove:  
//

void gkd(){
    int n;
    cin>>n;
    vector<int> arr(n);
    int ans=inf;
    for(int i=0;i<n;i++){
        cin>>arr[i];
        if(i){
            ans=min(ans,abs(arr[i]-arr[i-1]));
        }
    }
    drop(ans);
}

signed main(){
    cin.tie(0)->sync_with_stdio(0);
    int tt=1; 
    // cin>>tt;
    while(tt--) gkd();
    
    return 0;
}

Compilation message

pismo.cpp:19:1: warning: multi-line comment [-Wcomment]
   19 | //\\
      | ^

Subtask #1
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 8 ms 1884 KB Output is correct
6 Correct 9 ms 1884 KB Output is correct
7 Correct 8 ms 1796 KB Output is correct