oj.uz

Submission #117429

# Submission time Handle Problem Language Result Execution time Memory
117429 2019-06-15T22:26:36 Z duality Examination (JOI19_examination) C++11
2 / 100
 3000 ms 165812 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];
unordered_map<int,int> bit[100001];
int update(int x,int y) {
    int i,j;
    for (i = x+1; i <= a.size(); i += i & (-i)) {
        for (j = y+1; j <= b.size(); j += j & (-j)) {
            if (!bit[i].count(j)) bit[i][j] = 1;
            else bit[i][j]++;
        }
    }
    return 0;
}
int query(int x,int y) {
    int i,j,sum = 0;
    for (i = x+1; i > 0; i -= i & (-i)) {
        for (j = y+1; j > 0; j -= j & (-j)) {
            if (bit[i].count(j)) sum += bit[i][j];
        }
    }
    return sum;
}
int ans[100000];
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;
    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();
            update(x,y),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;
        ans[queries[i].i] = query(x,y);
    }
    for (i = 0; i < Q; i++) printf("%d\n",ans[i]);

    return 0;
}

Compilation message

examination.cpp: In function 'int update(int, int)':
examination.cpp:71:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = x+1; i <= a.size(); i += i & (-i)) {
                   ~~^~~~~~~~~~~
examination.cpp:72:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = y+1; j <= b.size(); j += j & (-j)) {
                       ~~^~~~~~~~~~~
examination.cpp: In function 'int main()':
examination.cpp:92: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:94: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:102: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

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5760 KB Output is correct
2 Correct 6 ms 5760 KB Output is correct
3 Correct 6 ms 5760 KB Output is correct
4 Correct 6 ms 5888 KB Output is correct
5 Correct 7 ms 5888 KB Output is correct
6 Correct 7 ms 5760 KB Output is correct
7 Correct 32 ms 8952 KB Output is correct
8 Correct 31 ms 8952 KB Output is correct
9 Correct 31 ms 8952 KB Output is correct
10 Correct 14 ms 6656 KB Output is correct
11 Correct 14 ms 6520 KB Output is correct
12 Correct 10 ms 6016 KB Output is correct
13 Correct 31 ms 8960 KB Output is correct
14 Correct 33 ms 8952 KB Output is correct
15 Correct 33 ms 8956 KB Output is correct
16 Correct 11 ms 6144 KB Output is correct
17 Correct 11 ms 6272 KB Output is correct
18 Correct 8 ms 6016 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3062 ms 165812 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3062 ms 165812 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5760 KB Output is correct
2 Correct 6 ms 5760 KB Output is correct
3 Correct 6 ms 5760 KB Output is correct
4 Correct 6 ms 5888 KB Output is correct
5 Correct 7 ms 5888 KB Output is correct
6 Correct 7 ms 5760 KB Output is correct
7 Correct 32 ms 8952 KB Output is correct
8 Correct 31 ms 8952 KB Output is correct
9 Correct 31 ms 8952 KB Output is correct
10 Correct 14 ms 6656 KB Output is correct
11 Correct 14 ms 6520 KB Output is correct
12 Correct 10 ms 6016 KB Output is correct
13 Correct 31 ms 8960 KB Output is correct
14 Correct 33 ms 8952 KB Output is correct
15 Correct 33 ms 8956 KB Output is correct
16 Correct 11 ms 6144 KB Output is correct
17 Correct 11 ms 6272 KB Output is correct
18 Correct 8 ms 6016 KB Output is correct
19 Execution timed out 3062 ms 165812 KB Time limit exceeded
20 Halted 0 ms 0 KB -