Submission #1386855


Source Code Expand

// Nurbakyt Madibek
// Look at my code! IT'S AWESOME

#include <iostream>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <ctime>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <cassert>
#include <unordered_map>
#include <bitset>
#include <unordered_set>

using namespace std;

#define pb push_back
#define pp pop_back
#define f first
#define s second
#define mp make_pair
#define sz(a) (int)((a).size())
#ifdef _WIN32
#  define I64 "%I64d"
#else
#  define I64 "%lld"
#endif
#define fname "."

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair < int, int > pi;
typedef pair < int, ull > pu;
typedef pair < ll, ll > pl;

const int inf = (int)1e9 + 123;
const ll infl = (ll)1e18 + 123;
const double eps = 1e-9;

const int MAX_N = (int)3e5 + 5;
const int mod = (int)1e9 + 7;

int n;
pi x[505];

int ans[MAX_N];

int main() {
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> x[i].f;
        x[i].s = i;
    }
    sort(x + 1, x + n + 1);
    vector < int > have;
    for (int i = 1, last = 0; i <= n; i++) {
        while(last + 1 < x[i].f) {
            last++;
            have.pb(last);
        }
        last++;
        ans[x[i].f] = x[i].s;
        for (int j = 1; j < x[i].s; j++) {
            if (have.empty()) {
                cout << "No\n";
                return 0;
            }
            ans[have.back()] = x[i].s;
            have.pp();
        }
    }
    
    have.clear();
    for (int i = n, last = n * n + 1; i > 0; i--) {
        while(last - 1 >= x[i].f) {
            last--;
            if (!ans[last])
                have.pb(last);
        }
        for (int j = x[i].s + 1; j <= n; j++) {
            if (have.empty()) {
                cout << "No\n";
                return 0;
            }
            ans[have.back()] = x[i].s;
            have.pp();
        }
    }
    
    for (int i = 1; i <= n * n; i++)
        assert(ans[i] > 0);
    cout << "Yes\n";
    assert(0);
    for (int i = 1; i <= n * n; i++)
        cout << ans[i] << ' ';
    return 0;
}

Submission Info

Submission Time
Task D - K-th K
User Nurbakhyt
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2383 Byte
Status RE
Exec Time 98 ms
Memory 1912 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 800
Status
AC × 1
RE × 1
AC × 22
WA × 21
RE × 6
Set Name Test Cases
Sample 0_00.txt, 0_01.txt
All 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt
Case Name Status Exec Time Memory
0_00.txt RE 96 ms 256 KB
0_01.txt AC 1 ms 256 KB
1_00.txt RE 96 ms 256 KB
1_01.txt RE 98 ms 1912 KB
1_02.txt WA 3 ms 1652 KB
1_03.txt WA 3 ms 1652 KB
1_04.txt RE 98 ms 1912 KB
1_05.txt RE 98 ms 1912 KB
1_06.txt WA 3 ms 1656 KB
1_07.txt WA 3 ms 1656 KB
1_08.txt RE 97 ms 1912 KB
1_09.txt AC 1 ms 256 KB
1_10.txt AC 3 ms 1780 KB
1_11.txt AC 1 ms 256 KB
1_12.txt AC 1 ms 256 KB
1_13.txt AC 3 ms 1908 KB
1_14.txt AC 1 ms 256 KB
1_15.txt WA 2 ms 1148 KB
1_16.txt AC 2 ms 384 KB
1_17.txt AC 2 ms 1272 KB
1_18.txt WA 2 ms 1276 KB
1_19.txt WA 3 ms 1272 KB
1_20.txt WA 2 ms 1144 KB
1_21.txt WA 3 ms 1272 KB
1_22.txt WA 2 ms 1272 KB
1_23.txt AC 2 ms 1144 KB
1_24.txt WA 3 ms 1272 KB
1_25.txt WA 2 ms 1144 KB
1_26.txt AC 2 ms 1144 KB
1_27.txt AC 2 ms 1020 KB
1_28.txt AC 1 ms 384 KB
1_29.txt AC 3 ms 1400 KB
1_30.txt WA 2 ms 1272 KB
1_31.txt WA 3 ms 1272 KB
1_32.txt AC 1 ms 256 KB
1_33.txt WA 3 ms 1276 KB
1_34.txt AC 1 ms 256 KB
1_35.txt AC 2 ms 1016 KB
1_36.txt WA 3 ms 1272 KB
1_37.txt WA 2 ms 1272 KB
1_38.txt WA 3 ms 1276 KB
1_39.txt AC 1 ms 384 KB
1_40.txt WA 2 ms 764 KB
1_41.txt AC 3 ms 1400 KB
1_42.txt WA 2 ms 1020 KB
1_43.txt WA 2 ms 1276 KB
1_44.txt AC 1 ms 256 KB
1_45.txt AC 1 ms 256 KB
1_46.txt AC 2 ms 384 KB