oj.uz

답안 #874277

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
874277 2023-11-16T15:22:40 Z Requiem Examination (JOI19_examination) C++17
2 / 100
 3000 ms 212684 KB 
#include<bits/stdc++.h>
//#define int long long
#define pb push_back
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define MOD 1000000007
#define INF 1e18
#define fi first
#define se second
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define sz(a) ((int)(a).size())
#define endl '\n'
#define all(a) a.begin(),a.end()
#define pi 3.14159265359
#define TASKNAME "examination"
template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
using namespace std;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
typedef vector<int> vi;
typedef pair<ii,ii> iv;
const int MAXN = 150005;
const int block = 316;
const int MAXBLOCK = 320;
int n,q,x;
iv score[MAXN], original[MAXN];
int BIT[330][5*MAXN],prep[MAXN],rev[MAXN],answer[MAXN];
vector<int> listval;
vector<iv> query;
void upd(int block,int id,int x){
    for(int i=id;i>0;i-=i&(-i)){
        BIT[block][i] += x;
    }
}
int get(int block,int id){
    int res = 0;
    for(int i=id;i<=listval.size();i+=i&(-i)){
        res += BIT[block][i];
    }
    return res;
}
int bs(int l,int r,int x){
    int res = r+1;
    while(l<=r){
        int mid = (l+r)>>1;
        if (original[mid].se.fi >= x){
            res = mid;
            r = mid - 1;
        }
        else l = mid + 1;
    }
    return res;
}
main()
{
    fast;
    if (fopen(TASKNAME".inp","r")){
        freopen(TASKNAME".inp","r",stdin);
        freopen(TASKNAME".out","w",stdout);
    }
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>score[i].se.fi>>score[i].se.se;
        score[i].fi.se = score[i].se.fi + score[i].se.se;
        listval.pb(score[i].se.fi);
        listval.pb(score[i].se.se);
        listval.pb(score[i].fi.se);
    }
    sort(score+1,score+1+n,[](const iv &a,const iv &b){
         return a.se.fi < b.se.fi;
    });

    for(int i=1;i<=q;i++){
        int x,y,z;
        cin>>x>>y>>z;
        listval.pb(x);
        listval.pb(y);
        listval.pb(z);
        query.pb({{i,x},{y,z}});
    }
    sort(listval.begin(),listval.end());
    listval.erase(unique(listval.begin(),listval.end()),listval.end());
    for(int i=1;i<=max(q,n);i++){
        if (i<=n){
            score[i].se.fi = lower_bound(all(listval),score[i].se.fi) - listval.begin() + 1;
            score[i].se.se = lower_bound(all(listval),score[i].se.se) - listval.begin() + 1;
            score[i].fi.se = lower_bound(all(listval),score[i].fi.se) - listval.begin() + 1;
        }
        if (i<=q){
            query[i-1].se.fi = lower_bound(all(listval),query[i-1].se.fi) - listval.begin() + 1;
            query[i-1].se.se = lower_bound(all(listval),query[i-1].se.se) - listval.begin() + 1;
            query[i-1].fi.se = lower_bound(all(listval),query[i-1].fi.se) - listval.begin() + 1;
        }
    }
    for(int i=1;i<=n;i++){
        score[i].fi.fi = i;
        original[i] = score[i];
    }
    sort(query.begin(),query.end(),[](const iv &a,const iv &b){
         return a.se.se > b.se.se;
    });
    sort(score+1,score+1+n,[](const iv &a,const iv &b){
         return a.fi.se > b.fi.se;
    });
    for(int i=1;i<MAXN;i++){
        prep[i] = i / block;
//        if (i==MAXN-1) cout<<prep[i]<<endl;
    }
//    for(int i=1;i<=n;i++){
//        cout<<score[i].fi.se<<' '<<score[i].se.fi<<' '<<score[i].se.se<<endl;
//    }
//    cout<<endl;
//    for(int i=1;i<=q;i++){
////        cout<<query[i-1].fi.se<<' '<<query[i-1].se.fi<<' '<<query[i-1].se.se<<endl;
//    }

    int ptr = 1;
    for(int i=0;i<query.size();i++){
        while(ptr <= n and score[ptr].fi.se >= query[i].se.se){
            int RealIndex = score[ptr].fi.fi;
            rev[RealIndex]++;
            int b = prep[RealIndex];

            upd(b,score[ptr].se.se,1);
            ptr++;
        }
        int start = bs(1,n,query[i].fi.se);
        int b = prep[start];

        for(int j=start;j<=n;j++){
            if (original[j].se.fi >= query[i].fi.se and
                original[j].se.se >= query[i].se.fi and
                original[j].fi.se >= query[i].se.se and
                rev[j] > 0){
                    answer[query[i].fi.fi]++;
            }
            if (prep[j] != prep[j+1]) {
//                cout<<"STOP: "<<j<<endl;
                break;
            }
        }
//        cout<<"INFO: "<<start<<' '<<b<<' '<<query[i].fi.fi<<' '<<query[i].fi.se<<endl;

        for(int cur=b+1;cur<MAXBLOCK;cur++){
            if (cur * block > n) break;
            answer[query[i].fi.fi] += get(cur,query[i].se.fi);
        }

    }
    for(int i=1;i<=q;i++){
        cout<<answer[i]<<endl;
    }
}

Compilation message

examination.cpp: In function 'int get(int, int)':
examination.cpp:38:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     for(int i=id;i<=listval.size();i+=i&(-i)){
      |                  ~^~~~~~~~~~~~~~~~
examination.cpp: At global scope:
examination.cpp:55:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   55 | main()
      | ^~~~
examination.cpp: In function 'int main()':
examination.cpp:119:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  119 |     for(int i=0;i<query.size();i++){
      |                 ~^~~~~~~~~~~~~
examination.cpp:59:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |         freopen(TASKNAME".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:60:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |         freopen(TASKNAME".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6604 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 9 ms 7260 KB Output is correct
8 Correct 8 ms 7260 KB Output is correct
9 Correct 8 ms 7260 KB Output is correct
10 Correct 6 ms 6876 KB Output is correct
11 Correct 8 ms 13144 KB Output is correct
12 Correct 5 ms 10844 KB Output is correct
13 Correct 9 ms 25180 KB Output is correct
14 Correct 9 ms 25312 KB Output is correct
15 Correct 9 ms 25308 KB Output is correct
16 Correct 7 ms 25180 KB Output is correct
17 Correct 5 ms 6748 KB Output is correct
18 Correct 3 ms 6748 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1789 ms 211112 KB Output is correct
2 Correct 1886 ms 211796 KB Output is correct
3 Correct 1881 ms 212684 KB Output is correct
4 Correct 827 ms 107320 KB Output is correct
5 Correct 1868 ms 207160 KB Output is correct
6 Correct 213 ms 105816 KB Output is correct
7 Execution timed out 3085 ms 211212 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1789 ms 211112 KB Output is correct
2 Correct 1886 ms 211796 KB Output is correct
3 Correct 1881 ms 212684 KB Output is correct
4 Correct 827 ms 107320 KB Output is correct
5 Correct 1868 ms 207160 KB Output is correct
6 Correct 213 ms 105816 KB Output is correct
7 Execution timed out 3085 ms 211212 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6604 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 9 ms 7260 KB Output is correct
8 Correct 8 ms 7260 KB Output is correct
9 Correct 8 ms 7260 KB Output is correct
10 Correct 6 ms 6876 KB Output is correct
11 Correct 8 ms 13144 KB Output is correct
12 Correct 5 ms 10844 KB Output is correct
13 Correct 9 ms 25180 KB Output is correct
14 Correct 9 ms 25312 KB Output is correct
15 Correct 9 ms 25308 KB Output is correct
16 Correct 7 ms 25180 KB Output is correct
17 Correct 5 ms 6748 KB Output is correct
18 Correct 3 ms 6748 KB Output is correct
19 Correct 1789 ms 211112 KB Output is correct
20 Correct 1886 ms 211796 KB Output is correct
21 Correct 1881 ms 212684 KB Output is correct
22 Correct 827 ms 107320 KB Output is correct
23 Correct 1868 ms 207160 KB Output is correct
24 Correct 213 ms 105816 KB Output is correct
25 Execution timed out 3085 ms 211212 KB Time limit exceeded
26 Halted 0 ms 0 KB -