oj.uz

답안 #466362

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
466362 2021-08-19T02:10:28 Z Namnamseo Matryoshka (JOI16_matryoshka) C++17
0 / 100
 0 ms 204 KB 
#include <bits/stdc++.h>
using namespace std;
void read(int& x){ scanf("%d",&x); }
template<typename T,typename... Args>
void read(T& a,Args&... b){ read(a); read(b...); }
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define ind(x,y) lower_bound(x.begin(), x.end(), y) - x.begin()
typedef pair<int,int> pp;
typedef tuple<int,int,int> tp;

int n, q;

vector<int> xp, yp;
vector<pp> pts;
vector<tp> qry;

int ans[200010];

struct SEG {
    static const int M = 524288;
    int tree[M<<1];
    
    void upd(int pos, int val){
        pos += M;
        while(pos) tree[pos]=max(tree[pos], val), pos>>=1;
    }
    
    int rmax(int l,int r){
        l+=M; r+=M;
        int ret=0;
        while(l<=r){
            if(l%2==1) ret=max(ret, tree[l++]);
            if(r%2==0) ret=max(ret, tree[r--]);
            l>>=1; r>>=1;
        }
        return ret;
    }
} seg;

int main()
{
    freopen("in", "r", stdin);
    read(n, q); pts.resize(n);
    for(auto& a:pts) read(a.first, a.second), xp.pb(a.first), yp.pb(a.second);
    qry.resize(q);
    for(int i=0; i<q; ++i){
        int x, y;
        read(x, y);
        qry[i]=make_tuple(x, y, i);
        xp.pb(x);
        yp.pb(y);
    }

    sort(all(xp)); xp.erase(unique(all(xp)), xp.end());
    sort(all(yp)); yp.erase(unique(all(yp)), yp.end());
    
    for(auto& a:pts) a.first=ind(xp, a.first), a.second=ind(yp, a.second);
    for(int j=0; j<q; ++j){
        int x, y, i;
        tie(x, y, i) = qry[j];
        x=ind(xp, x);
        y=ind(yp, y);
        qry[j] = tie(x, y, i);
    }
    
    sort(all(pts), [&](const pp& a, const pp& b){
         if(a.first != b.first) return a.first > b.first;
         return a.second < b.second;
    });

    sort(all(qry), greater<tp>());
    
    int ip=0, iq=0;
    
    for(int i=xp.size()-1; 0<=i; --i){
        while(ip < pts.size()){
            int x, y;
            tie(x, y) = pts[ip];
            if(x != i) break;
            int val = seg.rmax(0, y) + 1;
            seg.upd(y, val);
            ++ip;
        }
        while(iq < qry.size()){
            int x, y, ind;
            tie(x, y, ind) = qry[iq];
            if(x != i) break;
            int val = seg.rmax(0, y);
            ans[ind] = val;
            ++iq;
        }
    }
    
    for(int i=0; i<q; ++i) printf("%d\n", ans[i]);
    
    return 0;
}

Compilation message

matryoshka.cpp: In function 'int main()':
matryoshka.cpp:77:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |         while(ip < pts.size()){
      |               ~~~^~~~~~~~~~~~
matryoshka.cpp:85:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |         while(iq < qry.size()){
      |               ~~~^~~~~~~~~~~~
matryoshka.cpp: In function 'void read(int&)':
matryoshka.cpp:3:25: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    3 | void read(int& x){ scanf("%d",&x); }
      |                    ~~~~~^~~~~~~~~
matryoshka.cpp: In function 'int main()':
matryoshka.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen("in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -