oj.uz

답안 #117430

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
117430 2019-06-15T22:34:56 Z duality Examination (JOI19_examination) C++11
100 / 100
 461 ms 31400 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

struct query { int A,B,C,i; };
pii s[100000];
vi a,b;
bool comp(pii a,pii b) {
    return a.first+a.second > b.first+b.second;
}
bool comp2(query a,query b) {
    return a.C > b.C;
}
query queries[100000];
int ans[100000];
int bit[100001];
vpii bit2[100001];
int main() {
    int i;
    int N,Q;
    scanf("%d %d",&N,&Q);
    for (i = 0; i < N; i++) {
        scanf("%d %d",&s[i].first,&s[i].second);
        a.pb(-s[i].first),b.pb(-s[i].second);
    }
    sort(s,s+N,comp);
    sort(a.begin(),a.end());
    a.resize(unique(a.begin(),a.end())-a.begin());
    sort(b.begin(),b.end());
    b.resize(unique(b.begin(),b.end())-b.begin());
    for (i = 0; i < Q; i++) scanf("%d %d %d",&queries[i].A,&queries[i].B,&queries[i].C),queries[i].i = i;
    sort(queries,queries+Q,comp2);

    int j = 0,k;
    for (i = 0; i < Q; i++) {
        while ((j < N) && (s[j].first+s[j].second >= queries[i].C)) {
            int x = lower_bound(a.begin(),a.end(),-s[j].first)-a.begin();
            int y = lower_bound(b.begin(),b.end(),-s[j].second)-b.begin();
            for (k = x+1; k <= a.size(); k += k & (-k)) bit2[k].pb(mp(y,-1));
            j++;
        }
        int x = upper_bound(a.begin(),a.end(),-queries[i].A)-a.begin()-1;
        int y = upper_bound(b.begin(),b.end(),-queries[i].B)-b.begin()-1;
        for (k = x+1; k > 0; k -= k & (-k)) bit2[k].pb(mp(y,queries[i].i));
    }
    for (i = 1; i <= a.size(); i++) {
        for (j = 0; j < bit2[i].size(); j++) {
            if (bit2[i][j].second == -1) {
                for (k = bit2[i][j].first+1; k <= b.size(); k += k & (-k)) bit[k]++;
            }
            else {
                for (k = bit2[i][j].first+1; k > 0; k -= k & (-k)) ans[bit2[i][j].second] += bit[k];
            }
        }
        for (j = 0; j < bit2[i].size(); j++) {
            if (bit2[i][j].second == -1) {
                for (k = bit2[i][j].first+1; k <= b.size(); k += k & (-k)) bit[k] = 0;
            }
        }
    }
    for (i = 0; i < Q; i++) printf("%d\n",ans[i]);

    return 0;
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:92:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (k = x+1; k <= a.size(); k += k & (-k)) bit2[k].pb(mp(y,-1));
                           ~~^~~~~~~~~~~
examination.cpp:99:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 1; i <= a.size(); i++) {
                 ~~^~~~~~~~~~~
examination.cpp:100:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < bit2[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~
examination.cpp:102:48: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (k = bit2[i][j].first+1; k <= b.size(); k += k & (-k)) bit[k]++;
                                              ~~^~~~~~~~~~~
examination.cpp:108:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < bit2[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~~~
examination.cpp:110:48: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (k = bit2[i][j].first+1; k <= b.size(); k += k & (-k)) bit[k] = 0;
                                              ~~^~~~~~~~~~~
examination.cpp:74:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&N,&Q);
     ~~~~~^~~~~~~~~~~~~~~
examination.cpp:76:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&s[i].first,&s[i].second);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:84:88: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (i = 0; i < Q; i++) scanf("%d %d %d",&queries[i].A,&queries[i].B,&queries[i].C),queries[i].i = i;
                             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 3 ms 2688 KB Output is correct
4 Correct 3 ms 2688 KB Output is correct
5 Correct 3 ms 2688 KB Output is correct
6 Correct 3 ms 2688 KB Output is correct
7 Correct 10 ms 3200 KB Output is correct
8 Correct 10 ms 3200 KB Output is correct
9 Correct 10 ms 3200 KB Output is correct
10 Correct 8 ms 3200 KB Output is correct
11 Correct 8 ms 2944 KB Output is correct
12 Correct 6 ms 2944 KB Output is correct
13 Correct 10 ms 3328 KB Output is correct
14 Correct 10 ms 3328 KB Output is correct
15 Correct 10 ms 3200 KB Output is correct
16 Correct 7 ms 2944 KB Output is correct
17 Correct 8 ms 3200 KB Output is correct
18 Correct 5 ms 2816 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 23732 KB Output is correct
2 Correct 304 ms 26256 KB Output is correct
3 Correct 299 ms 26184 KB Output is correct
4 Correct 209 ms 25108 KB Output is correct
5 Correct 133 ms 13416 KB Output is correct
6 Correct 78 ms 12212 KB Output is correct
7 Correct 262 ms 27696 KB Output is correct
8 Correct 284 ms 26208 KB Output is correct
9 Correct 254 ms 27744 KB Output is correct
10 Correct 98 ms 9948 KB Output is correct
11 Correct 190 ms 25056 KB Output is correct
12 Correct 57 ms 8680 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 23732 KB Output is correct
2 Correct 304 ms 26256 KB Output is correct
3 Correct 299 ms 26184 KB Output is correct
4 Correct 209 ms 25108 KB Output is correct
5 Correct 133 ms 13416 KB Output is correct
6 Correct 78 ms 12212 KB Output is correct
7 Correct 262 ms 27696 KB Output is correct
8 Correct 284 ms 26208 KB Output is correct
9 Correct 254 ms 27744 KB Output is correct
10 Correct 98 ms 9948 KB Output is correct
11 Correct 190 ms 25056 KB Output is correct
12 Correct 57 ms 8680 KB Output is correct
13 Correct 326 ms 26392 KB Output is correct
14 Correct 321 ms 26472 KB Output is correct
15 Correct 298 ms 26088 KB Output is correct
16 Correct 228 ms 25312 KB Output is correct
17 Correct 136 ms 13732 KB Output is correct
18 Correct 83 ms 12224 KB Output is correct
19 Correct 345 ms 26432 KB Output is correct
20 Correct 340 ms 26552 KB Output is correct
21 Correct 342 ms 27968 KB Output is correct
22 Correct 102 ms 9828 KB Output is correct
23 Correct 205 ms 24952 KB Output is correct
24 Correct 59 ms 8552 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2688 KB Output is correct
2 Correct 4 ms 2688 KB Output is correct
3 Correct 3 ms 2688 KB Output is correct
4 Correct 3 ms 2688 KB Output is correct
5 Correct 3 ms 2688 KB Output is correct
6 Correct 3 ms 2688 KB Output is correct
7 Correct 10 ms 3200 KB Output is correct
8 Correct 10 ms 3200 KB Output is correct
9 Correct 10 ms 3200 KB Output is correct
10 Correct 8 ms 3200 KB Output is correct
11 Correct 8 ms 2944 KB Output is correct
12 Correct 6 ms 2944 KB Output is correct
13 Correct 10 ms 3328 KB Output is correct
14 Correct 10 ms 3328 KB Output is correct
15 Correct 10 ms 3200 KB Output is correct
16 Correct 7 ms 2944 KB Output is correct
17 Correct 8 ms 3200 KB Output is correct
18 Correct 5 ms 2816 KB Output is correct
19 Correct 303 ms 23732 KB Output is correct
20 Correct 304 ms 26256 KB Output is correct
21 Correct 299 ms 26184 KB Output is correct
22 Correct 209 ms 25108 KB Output is correct
23 Correct 133 ms 13416 KB Output is correct
24 Correct 78 ms 12212 KB Output is correct
25 Correct 262 ms 27696 KB Output is correct
26 Correct 284 ms 26208 KB Output is correct
27 Correct 254 ms 27744 KB Output is correct
28 Correct 98 ms 9948 KB Output is correct
29 Correct 190 ms 25056 KB Output is correct
30 Correct 57 ms 8680 KB Output is correct
31 Correct 326 ms 26392 KB Output is correct
32 Correct 321 ms 26472 KB Output is correct
33 Correct 298 ms 26088 KB Output is correct
34 Correct 228 ms 25312 KB Output is correct
35 Correct 136 ms 13732 KB Output is correct
36 Correct 83 ms 12224 KB Output is correct
37 Correct 345 ms 26432 KB Output is correct
38 Correct 340 ms 26552 KB Output is correct
39 Correct 342 ms 27968 KB Output is correct
40 Correct 102 ms 9828 KB Output is correct
41 Correct 205 ms 24952 KB Output is correct
42 Correct 59 ms 8552 KB Output is correct
43 Correct 461 ms 31064 KB Output is correct
44 Correct 405 ms 30812 KB Output is correct
45 Correct 395 ms 31400 KB Output is correct
46 Correct 271 ms 29164 KB Output is correct
47 Correct 147 ms 15068 KB Output is correct
48 Correct 84 ms 12004 KB Output is correct
49 Correct 374 ms 30144 KB Output is correct
50 Correct 379 ms 31320 KB Output is correct
51 Correct 333 ms 29796 KB Output is correct
52 Correct 123 ms 11612 KB Output is correct
53 Correct 212 ms 28636 KB Output is correct