Submission #1012720

#	Time	Username	Problem	Language	Result	Execution time	Memory
1012720		c2zi6	Seats (IOI18_seats)	C++14	11 / 100	4043 ms	41408 KiB

seats

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "seats.h"

int n, m;
VPI tex;

void give_initial_chart(int H, int W, VI R, VI C) {
    n = H;
    m = W;
    rep(i, n*m) tex.pb({R[i], C[i]});
}

int swap_seats(int a, int b) {
    swap(tex[a], tex[b]);
    int mnx, mxx, mny, mxy;
    mnx = mny = +2e9;
    mxx = mxy = -2e9;
    int ans = 0;
    int c = 0;
    for (auto[x, y] : tex) {
        setmin(mnx, x);
        setmax(mxx, x);
        setmin(mny, y);
        setmax(mxy, y);
        c++;
        ans += (c == (mxx-mnx+1)*(mxy-mny+1));
    }
    return ans;
}

Compilation message (stderr)

seats.cpp: In function 'int swap_seats(int, int)':
seats.cpp:50:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   50 |     for (auto[x, y] : tex) {
      |              ^

• Subtask 1: 5 / 5
• Subtask 2: 6 / 6
• Subtask 3: 0 / 20
• Subtask 4: 0 / 6
• Subtask 5: 0 / 33
• Subtask 6: 0 / 30