oj.uz

답안 #1008849

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1008849 2024-06-27T02:20:06 Z PenguinsAreCute Trampoline (info1cup20_trampoline) C++17
62 / 100
 2000 ms 62652 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 420690;
const int INF = 1210201069;
vector<pair<int,int>> seg[MAXN<<1];
int f(int i, int x) {
  return (*lower_bound(seg[i].begin(),seg[i].end(),make_pair(x,0LL))).second;
}
void build() {
  for(int i=MAXN;i--;)
    for(auto [j, k]: seg[i<<1])
      seg[i].push_back({j,f(i<<1|1,k)});
}
int qry(int l, int r, int x) {
  stack<int> st;
  for(l+=MAXN,r+=MAXN;l<r;l>>=1,r>>=1) {
    if(l&1) x=f(l++,x);
    if(r&1) st.push(--r);
  }
  while(st.size()) {
    x=f(st.top(),x);
    st.pop();
  }
  return x;
}
main() {
  ios_base::sync_with_stdio(0); cin.tie(0);
  int r, c, n; cin >> r >> c >> n;
  vector<int> v; int x[n], y[n];
  for(int i=0;i<n;i++) {
    cin >> x[i] >> y[i];
    v.push_back(x[i]);
    v.push_back(x[i]+1);
  }

  sort(v.begin(),v.end());
  v.resize(unique(v.begin(),v.end())-v.begin());
  for(int i=0;i<n;i++)
    x[i]=lower_bound(v.begin(),v.end(),x[i])-v.begin();
  for(int i=0;i<n;i++)
    seg[x[i]+MAXN].push_back({y[i],y[i]});
  for(int i=0;i<n;i++)
    sort(seg[x[i]+MAXN].begin(),seg[x[i]+MAXN].end());
  for(int i=0;i<MAXN;i++)
    seg[i+MAXN].push_back({INF,INF});
  build();

  int t; cin >> t;
  while(t--) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if(x1==x2) {
      cout << (y1<=y2?"Yes\n":"No\n");
      continue;
    }
    if(x1>x2) {
      cout << "No\n";
      continue;
    }
    auto it1 = lower_bound(v.begin(),v.end(),x1);
    auto it2 = lower_bound(v.begin(),v.end(),x2);
    if(it1==v.end()||it2==v.end()||(*it1)!=x1||(*it2)!=x2) {
      cout << "No\n";
      continue;
    }
    cout << (qry(it1-v.begin(),it2-v.begin(),y1)<=y2?"Yes\n":"No\n");
  }
} // noice

Compilation message

trampoline.cpp:27:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   27 | main() {
      | ^~~~

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 47064 KB 200 token(s): yes count is 21, no count is 179
2 Correct 54 ms 47112 KB 200 token(s): yes count is 70, no count is 130
3 Correct 74 ms 47104 KB 197 token(s): yes count is 25, no count is 172

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 216 ms 62652 KB 4000 token(s): yes count is 99, no count is 3901
2 Correct 227 ms 62428 KB 4000 token(s): yes count is 91, no count is 3909
3 Correct 659 ms 60608 KB 4000 token(s): yes count is 4000, no count is 0
4 Correct 210 ms 62460 KB 4000 token(s): yes count is 1991, no count is 2009

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2075 ms 31748 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 46880 KB 5000 token(s): yes count is 3238, no count is 1762
2 Correct 52 ms 46940 KB 5000 token(s): yes count is 3837, no count is 1163
3 Correct 45 ms 46932 KB 5000 token(s): yes count is 4104, no count is 896
4 Correct 107 ms 46676 KB 5000 token(s): yes count is 3934, no count is 1066
5 Correct 46 ms 46680 KB 5000 token(s): yes count is 3384, no count is 1616
6 Correct 146 ms 46676 KB 5000 token(s): yes count is 3390, no count is 1610

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 326 ms 61928 KB 200000 token(s): yes count is 171404, no count is 28596
2 Correct 305 ms 62404 KB 200000 token(s): yes count is 161254, no count is 38746
3 Execution timed out 2060 ms 30652 KB Time limit exceeded
4 Halted 0 ms 0 KB -