Submission #1199302

#	Time	Username	Problem	Language	Result	Execution time	Memory
1199302		n3rm1n	Seats (IOI18_seats)	C++20	17 / 100	4093 ms	67136 KiB

seats

#include <bits/stdc++.h>
#include "seats.h"
#define pb push_back
using namespace std;
const int maxn = 1e6 + 10;
int n, h, w;
long long r[maxn], c[maxn];
int is[maxn];
long long mnr[maxn], mxr[maxn];
long long mnc[maxn], mxc[maxn];
int ans = 0;
void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C)
{
  h = H;
  w = W;
  n = h * w;
  for (int i = 0; i < n; ++ i)
  {
      r[i] = R[i];
      c[i] = C[i];
  }
  long long minr = r[0];
  long long maxr = r[0];
  long long minc = c[0];
  long long maxc = c[0];

  for (int i = 0; i < n; ++ i)
  {
      minr = min(minr, r[i]);
      maxr = max(maxr, r[i]);
      minc = min(minc, c[i]);
      maxc = max(maxc, c[i]);
      mnr[i] = minr;
      mxr[i] = maxr;
      mnc[i] = minc;
      mxc[i] = maxc;
      int total = (maxc - minc + 1) * (maxr - minr + 1);
      if(total == i+1)
      {
          is[i] = 1;
          ans ++;
      }
  }
//  cout << "ans ids " << ans << endl;

}

int swap_seats(int a, int b)
{
    swap(r[a], r[b]);
    swap(c[a], c[b]);
    for (int i = min(a, b); i <= max(a, b); ++ i)
    {
        ans -= is[i];
        if(i != 0)
        {
            mnr[i] = mnr[i-1];
        mxr[i] = mxr[i-1];
        mnc[i] = mnc[i-1];
        mxc[i] = mxc[i-1];

         mnr[i] = min(mnr[i], r[i]);
      mxr[i] = max(mxr[i], r[i]);
      mnc[i] = min(mnc[i], c[i]);
      mxc[i] = max(mxc[i], c[i]);
        }
        else
        {
            mnr[i] = r[i];
      mxr[i] = r[i];
      mnc[i] = c[i];
      mxc[i] = c[i];
        }
      long long total = (mxc[i] - mnc[i] + 1) * (mxr[i] - mnr[i] + 1);
      if(total == i+1)
      {
          is[i] = 1;
          ans ++;
      }
      else is[i] = 0;
    }
    return ans;
}

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