Submission #1279820

#	Time	Username	Problem	Language	Result	Execution time	Memory
1279820		icebear	Passport (JOI23_passport)	C++20	40 / 100	2098 ms	74380 KiB

passport

// ~~ icebear ~~
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

template<class T>
    bool minimize(T &a, const T &b) {
        if (a > b) return a = b, true;
        return false;
    }

template<class T>
    bool maximize(T &a, const T &b) {
        if (a < b) return a = b, true;
        return false;
    }

#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RED(i, n) for(int i=(n)-1; i>=0; --i)
#define MASK(i) (1LL << (i))
#define BIT(S, i) (((S) >> (i)) & 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "gen"
/*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN VOI26 */

const int MOD = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 1e18 + 27092008;
const int N = 2500 + 5;
int n, dist[N][N], l[N], r[N];
int mx[N][N], mn[N][N];

int dp(int s) {
    memset(dist, 0x3f, sizeof dist);
    dist[l[s]][r[s]] = 1;
    priority_queue<array<int, 3>, vector<array<int, 3>>, greater<array<int, 3>>> Q;
    Q.push({1, l[s], r[s]});
    while(!Q.empty()) {
        auto T = Q.top(); Q.pop();
        if (T[0] != dist[T[1]][T[2]]) continue;
        if (T[1] == 1 && T[2] == n) return T[0];
        int i = T[1], j = T[2];
        if (i + 1 <= j && minimize(dist[i + 1][j], T[0])) Q.push({T[0], i + 1, j});
        if (i <= j - 1 && minimize(dist[i][j - 1], T[0])) Q.push({T[0], i, j - 1});
        if (minimize(dist[i][mx[i][j]], T[0] + 1)) Q.push({T[0] + 1, i, mx[i][j]});
        if (minimize(dist[mn[i][j]][j], T[0] + 1)) Q.push({T[0] + 1, mn[i][j], j});
        if (minimize(dist[l[i]][r[i]], T[0] + 1)) Q.push({T[0] + 1, l[i], r[i]});
        if (minimize(dist[l[j]][r[j]], T[0] + 1)) Q.push({T[0] + 1, l[j], r[j]});
    }
    return inf;
}

void init(void) {
    cin >> n;
    FOR(i, 1, n) cin >> l[i] >> r[i];
}

void process(void) {
    memset(mn, 0x3f, sizeof mn);
    FOR(i, 1, n) FOR(j, i, n) {
      mx[i][j] = max(mx[i][j - 1], r[j]);
      mn[i][j] = min(mn[i][j - 1], l[j]);
    }
    int q;
    cin >> q;
    while(q--) {
        int x; cin >> x;
        int ans = dp(x);
        cout << (ans == inf ? -1 : ans) << '\n';
        cerr << (ans == inf ? -1 : ans) << '\n';
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int tc = 1;
//    cin >> tc;
    while(tc--) {
        init();
        process();
    }
    return 0;
}

Compilation message (stderr)

passport.cpp: In function 'int main()':
passport.cpp:87:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   87 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
passport.cpp:88:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 6
• Subtask 2: 16 / 16
• Subtask 3: 24 / 24
• Subtask 4: 0 / 8
• Subtask 5: 0 / 46