Submission #443769

#	Time	Username	Problem	Language	Result	Execution time	Memory
443769		xiaowuc1	조화행렬 (KOI18_matrix)	C++17	29 / 100	188 ms	8848 KiB

matrix

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
// END NO SAD

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> matrix;

void twosolve(int n) {
  vector<array<int, 2>> v(n);
  for(int i = 0; i < 2; i++) {
    vector<int> vals;
    vector<int> sorted;
    for(int a = 0; a < n; a++) {
      int x;
      cin >> x;
      vals.pb(x);
      sorted.pb(x);
    }
    sort(all(sorted));
    for(auto& x: vals) x = lb(all(sorted), x) - sorted.begin();
    for(int a = 0; a < n; a++) v[a][i] = vals[a];
  }
  sort(all(v));
  vector<int> dp(n+1);
  int ret = 0;
  for(int i = 0; i < n; i++) {
    int lhs = 0;
    int rhs = ret;
    while(lhs < rhs) {
      int mid = (lhs+rhs+1)/2;
      if(v[i][1] > v[dp[mid]][1]) lhs = mid;
      else rhs = mid-1;
    }
    ret = max(ret, lhs+1);
    dp[++lhs] = i;
  }
  cout << ret << "\n";
}

void solve() {
  int r, c;
  cin >> r >> c;
  if(r == 2) twosolve(c);
}

// what would chika do
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases
// are you doing geometry in floating points

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);
  solve();
}

• Subtask 1: 14 / 14
• Subtask 2: 0 / 9
• Subtask 3: 15 / 15
• Subtask 4: 0 / 62