제출 #1285584

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1285584		vahagng	Pismo (COCI18_pismo)	C++20	0 / 70	112 ms	24532 KiB

pismo

//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;

// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

void print(long long t) { cerr << t; }
void print(int t) { cerr << t; }
void print(string t) { cerr << t; }
void print(char t) { cerr << t; }
void print(double t) { cerr << t; }
void print(long double t) { cerr << t; }
void print(unsigned long long t) { cerr << t; }

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[], V n) { cerr << "["; for (int i = 0; i < n; i++) { cerr << v[i] << " "; } cerr << "]"; }
template <class T, class V> void print(pair <T, V> p) { cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}"; }
template <class T> void print(vector <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(multiset <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void print(map <T, V> v) { cerr << "[ "; for (auto i : v) { print(i); cerr << " "; } cerr << "]"; }

#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'

const ll inf = 2e18, mod = 1e9 + 7, mod2 = 998244353;

void SetIO(string str = "") {
    if (str != "") {
        freopen((str + ".in").c_str(), "r", stdin);
        freopen((str + ".out").c_str(), "w", stdout);
    }
    else {
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    }
}

void FastIO() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}

const int N = 2e5 + 10, M = 1e7 + 10;
const double eps = 1e-7;

mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());

ll binpow(ll a, ll b, ll m) {
    ll res = 1;
    while (b) {
        if (b & 1) {
            res = (res * a) % m;
        }
        b >>= 1;
        a = (a * a) % m;
    }
    return res;
}

ll n, a[N], l_mn[N], l_mx[N], r_mn[N], r_mx[N];

void solve(int tc) {
    cin >> n;
    vector<ll>v;
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 1; i <= n; i++) v.push_back(a[i]);
    sort(all(v));
    v.erase(unique(all(v)), v.end());
    bool flag = 0;
    for(int i = 2; i <= n; i++){
        flag |= (a[i] == a[i-1]);
    }
    if(flag){
        cout << 0 << endl;
        return;
    }
    for(int i = 2; i <= n; i++){
        if(a[i] >= a[i-1]) l_mx[i] = l_mx[i-1] + 1;
        else l_mx[i] = 0;
        if(a[i] <= a[i-1]) l_mn[i] = l_mn[i-1] + 1;
        else l_mn[i] = 0;
    }
    for(int i = n-1; i >= 1; i--){
        if(a[i] >= a[i+1]) r_mx[i] = r_mx[i+1] + 1;
        else r_mx[i] = 0;
        if(a[i] <= a[i+1]) r_mn[i] = r_mn[i+1] + 1;
        else r_mn[i] = 0;
    }
    map<ll, vector<pair<ll, ll>>>mp1, mp2;
    for(int i = 1; i <= n; i++){
        mp1[a[i]].push_back({i - l_mn[i], i + r_mn[i]});
        mp2[a[i]].push_back({i - l_mx[i], i + r_mx[i]});
    }
    ll ans = inf;
    for(int i = 1; i < v.size(); i++){
        ll pre = v[i-1], cur = v[i];
        for(auto [lx, rx] : mp1[pre]){
            for(auto [l, r] : mp2[cur]){
                if(rx >= l - 1 || r >= lx - 1){
                    ans = min(ans, cur - pre);
                }
            }
        }
    }
    cout << ans << endl;
}


void precalc() {
    
}

int main() {
    // SetIO("teamwork");
    FastIO();
    int test_case = 1;
    // cin >> test_case;
    precalc();
    int cnt = 1;
    while (test_case--) {
        solve(cnt++);
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

pismo.cpp: In function 'void SetIO(std::string)':
pismo.cpp:47:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |         freopen((str + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
pismo.cpp:48:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         freopen((str + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
pismo.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
pismo.cpp:52:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         freopen("output.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 70