oj.uz

Submission #258913

# Submission time Handle Problem Language Result Execution time Memory
258913 2020-08-06T18:06:04 Z uacoder123 Examination (JOI19_examination) C++14
100 / 100
 2915 ms 247456 KB 
        #include <bits/stdc++.h>
        #include <ext/pb_ds/assoc_container.hpp>
        using namespace std;
        using namespace __gnu_pbds;
        #define F first
        #define S second
        #define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
        #define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
        #define all(x) (x).begin(), (x).end()
        #define sz(x) int(x.size())
        #define mp(i,a) make_pair(i,a)
        #define pb(a) push_back(a)
        #define bit(x,b) (x&(1LL<<b))
         
        typedef int lli;
        typedef pair <lli,lli> ii;
        typedef pair <lli,ii> iii;
        typedef vector <lli> vi;
        typedef tree<
        ii,
        null_type,
        less<ii>,
        rb_tree_tag,
        tree_order_statistics_node_update>
        ordered_set;
         
        ordered_set segt[8*100000+1];
        lli n,q,co=1;
        void up(lli node,lli l,lli r,lli in,lli v)
        {
          segt[node].insert(mp(v,co));
          co++;
          lli m=(l+r)/2;
          if(l!=r)
          {
            if(in<=m)
              up(2*node+1,l,m,in,v);
            else
              up(2*node+2,m+1,r,in,v);
          }
        }
        lli query(lli node,lli l,lli r,lli s,lli e,lli v)
        {
          if(r<s||l>e)
            return(0);
          if(l>=s&&r<=e)
            return segt[node].size()-segt[node].order_of_key(mp(v,0));
          lli m=(l+r)/2;
          lli q1=query(2*node+1,l,m,s,e,v),q2=query(2*node+2,m+1,r,s,e,v);
          return(q1+q2);
        }
        int main()
        {
          ios_base::sync_with_stdio(false);
          cin.tie(NULL);
          cin>>n>>q;
          set<long long int> v,v1;
          unordered_map<long long int,lli> m,m1;
          ii s[n];
          pair<ii,long long int> qu[q];
          for(lli i=0;i<n;++i)
          {
            cin>>s[i].F>>s[i].S;
            v.insert(s[i].F);
            v1.insert(s[i].F*1LL+s[i].S);
          }
          for(lli i=0;i<q;++i)
          {
            cin>>qu[i].F.F>>qu[i].F.S>>qu[i].S;
            v.insert(qu[i].F.F);
            v1.insert(qu[i].S*1LL); 
          }
          auto it=v.begin();
          lli c=0;
          while(it!=v.end())
          {
            m[(*it)]=c;
            c++;
            it++;
          }
          vector<vector<iii>> quer;
          vi sums;
          for(lli i=0;i<n;++i)
          {
            lli su=s[i].F*1LL+s[i].S;
            s[i].F=m[s[i].F];
            if(m1.find(su)==m1.end())
            {
              m1[su]=quer.size();
              quer.pb(vector<iii>(0));
              sums.pb(su);              
            }
            quer[m1[su]].pb(mp(-1,mp(s[i].F,s[i].S)));
          }
          for(lli i=0;i<q;++i)
          {
            qu[i].F.F=m[qu[i].F.F];
            if(m1.find(qu[i].S)==m1.end())
            {
              m1[qu[i].S]=quer.size();
              quer.pb(vector<iii>(0));
              sums.pb(qu[i].S);              
            }
            quer[m1[qu[i].S]].pb(mp(i,mp(qu[i].F.F,qu[i].F.S)));  
          }
          sort(all(sums));
          lli ans[q]={};
          for(lli i=sums.size()-1;i>=0;--i)
          {
            lli j=0;
            for(;j<quer[m1[sums[i]]].size();++j)
            {
              if(quer[m1[sums[i]]][j].F==-1)
                up(0,0,c-1,quer[m1[sums[i]]][j].S.F,quer[m1[sums[i]]][j].S.S);
              else
                break;
          }
            for(;j<quer[m1[sums[i]]].size();++j)
              ans[quer[m1[sums[i]]][j].F]=query(0,0,c-1,quer[m1[sums[i]]][j].S.F,c-1,quer[m1[sums[i]]][j].S.S);
          }
          for(lli i=0;i<q;++i)
            cout<<ans[i]<<'\n';
          return(0);
        }

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:111:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(;j<quer[m1[sums[i]]].size();++j)
                  ~^~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:118:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(;j<quer[m1[sums[i]]].size();++j)
                  ~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 75512 KB Output is correct
2 Correct 65 ms 75512 KB Output is correct
3 Correct 72 ms 75512 KB Output is correct
4 Correct 66 ms 75508 KB Output is correct
5 Correct 65 ms 75512 KB Output is correct
6 Correct 64 ms 75428 KB Output is correct
7 Correct 89 ms 79736 KB Output is correct
8 Correct 99 ms 79736 KB Output is correct
9 Correct 88 ms 79736 KB Output is correct
10 Correct 87 ms 79608 KB Output is correct
11 Correct 76 ms 77432 KB Output is correct
12 Correct 74 ms 76536 KB Output is correct
13 Correct 84 ms 79224 KB Output is correct
14 Correct 89 ms 79224 KB Output is correct
15 Correct 84 ms 79224 KB Output is correct
16 Correct 71 ms 76536 KB Output is correct
17 Correct 84 ms 79608 KB Output is correct
18 Correct 69 ms 76412 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2373 ms 210824 KB Output is correct
2 Correct 2210 ms 210664 KB Output is correct
3 Correct 2266 ms 210924 KB Output is correct
4 Correct 1557 ms 208768 KB Output is correct
5 Correct 582 ms 119992 KB Output is correct
6 Correct 436 ms 110892 KB Output is correct
7 Correct 2029 ms 206208 KB Output is correct
8 Correct 2029 ms 210604 KB Output is correct
9 Correct 1877 ms 206424 KB Output is correct
10 Correct 289 ms 103824 KB Output is correct
11 Correct 1261 ms 208508 KB Output is correct
12 Correct 340 ms 100580 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2373 ms 210824 KB Output is correct
2 Correct 2210 ms 210664 KB Output is correct
3 Correct 2266 ms 210924 KB Output is correct
4 Correct 1557 ms 208768 KB Output is correct
5 Correct 582 ms 119992 KB Output is correct
6 Correct 436 ms 110892 KB Output is correct
7 Correct 2029 ms 206208 KB Output is correct
8 Correct 2029 ms 210604 KB Output is correct
9 Correct 1877 ms 206424 KB Output is correct
10 Correct 289 ms 103824 KB Output is correct
11 Correct 1261 ms 208508 KB Output is correct
12 Correct 340 ms 100580 KB Output is correct
13 Correct 2135 ms 218068 KB Output is correct
14 Correct 2482 ms 216868 KB Output is correct
15 Correct 2305 ms 210700 KB Output is correct
16 Correct 1546 ms 212076 KB Output is correct
17 Correct 615 ms 123452 KB Output is correct
18 Correct 432 ms 110956 KB Output is correct
19 Correct 2224 ms 218024 KB Output is correct
20 Correct 2405 ms 217276 KB Output is correct
21 Correct 2275 ms 216816 KB Output is correct
22 Correct 301 ms 104000 KB Output is correct
23 Correct 1243 ms 208388 KB Output is correct
24 Correct 344 ms 100704 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 75512 KB Output is correct
2 Correct 65 ms 75512 KB Output is correct
3 Correct 72 ms 75512 KB Output is correct
4 Correct 66 ms 75508 KB Output is correct
5 Correct 65 ms 75512 KB Output is correct
6 Correct 64 ms 75428 KB Output is correct
7 Correct 89 ms 79736 KB Output is correct
8 Correct 99 ms 79736 KB Output is correct
9 Correct 88 ms 79736 KB Output is correct
10 Correct 87 ms 79608 KB Output is correct
11 Correct 76 ms 77432 KB Output is correct
12 Correct 74 ms 76536 KB Output is correct
13 Correct 84 ms 79224 KB Output is correct
14 Correct 89 ms 79224 KB Output is correct
15 Correct 84 ms 79224 KB Output is correct
16 Correct 71 ms 76536 KB Output is correct
17 Correct 84 ms 79608 KB Output is correct
18 Correct 69 ms 76412 KB Output is correct
19 Correct 2373 ms 210824 KB Output is correct
20 Correct 2210 ms 210664 KB Output is correct
21 Correct 2266 ms 210924 KB Output is correct
22 Correct 1557 ms 208768 KB Output is correct
23 Correct 582 ms 119992 KB Output is correct
24 Correct 436 ms 110892 KB Output is correct
25 Correct 2029 ms 206208 KB Output is correct
26 Correct 2029 ms 210604 KB Output is correct
27 Correct 1877 ms 206424 KB Output is correct
28 Correct 289 ms 103824 KB Output is correct
29 Correct 1261 ms 208508 KB Output is correct
30 Correct 340 ms 100580 KB Output is correct
31 Correct 2135 ms 218068 KB Output is correct
32 Correct 2482 ms 216868 KB Output is correct
33 Correct 2305 ms 210700 KB Output is correct
34 Correct 1546 ms 212076 KB Output is correct
35 Correct 615 ms 123452 KB Output is correct
36 Correct 432 ms 110956 KB Output is correct
37 Correct 2224 ms 218024 KB Output is correct
38 Correct 2405 ms 217276 KB Output is correct
39 Correct 2275 ms 216816 KB Output is correct
40 Correct 301 ms 104000 KB Output is correct
41 Correct 1243 ms 208388 KB Output is correct
42 Correct 344 ms 100704 KB Output is correct
43 Correct 2599 ms 247208 KB Output is correct
44 Correct 2685 ms 247328 KB Output is correct
45 Correct 2915 ms 247380 KB Output is correct
46 Correct 1906 ms 245652 KB Output is correct
47 Correct 820 ms 139740 KB Output is correct
48 Correct 395 ms 110840 KB Output is correct
49 Correct 2522 ms 247352 KB Output is correct
50 Correct 2442 ms 247456 KB Output is correct
51 Correct 2282 ms 247212 KB Output is correct
52 Correct 629 ms 123736 KB Output is correct
53 Correct 1529 ms 231356 KB Output is correct