oj.uz

답안 #705802

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
705802 2023-03-05T10:13:09 Z epicci23 Exhibition (JOI19_ho_t2) C++17
0 / 100
 1 ms 212 KB 
#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}

set<pii> s;
int maxi=0;
void upd(int x)
{ 
  auto it=s.upper_bound({x,INF});it--;
  pii yen={x,(*it).ss+1};
  vector<pii> todo;
  for(it=s.upper_bound({x,0});it!=s.end();it++)
  {
    if((*it).ss==yen.ss || yen.ff==(*it).ff) todo.pb(*it);
    else break;
  }
  s.insert(yen);
  maxi=max(maxi,yen.ss);
  for(pii y:todo) s.erase(y);
}


void solve()
{
  int n=in(),m=in();
  vector<array<int,2>> v(n);
  for(int i=0;i<n;i++) {v[i][1]=in();v[i][0]=in();}
  sort(all(v));
  vector<int> qu(m);
  for(int i=0;i<m;i++) qu[i]=in();

  sort(rall(qu));
  int l=0,r=m;
   
  while(l<r)
  {
    maxi=0;
    s.clear();
    s.insert({0,0});
    s.insert({INF,INF});
    int mi=(l+r)/2;
    if(l==mi) mi++;
    //cout << "l: " << l << " r: " << r << endl;
    vector<int> q;
    for(int i=0;i<mi;i++) q.pb(qu[i]);
    reverse(all(q));
    int p=0;
    bool ok=1;
    for(int i=0;i<mi;i++)
    {
      //cout << "q: " << q[i] << endl;
      while(p<n && v[p][1]<=q[i])
      {
        //cout << "vp: " << v[p][1] << endl;
        upd(v[p][1]);
        p++;
      }
      //for(auto x:s) cout << x.ff << " " << x.ss << endl;
      if(maxi<i+1) ok=0;
    }
    if(ok) l=mi;
    else r=mi-1;
  }
  cout << l << endl;
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message

joi2019_ho_t2.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -