oj.uz

Submission #255833

# Submission time Handle Problem Language Result Execution time Memory
255833 2020-08-01T23:21:20 Z uacoder123 Examination (JOI19_examination) C++14
43 / 100
 3000 ms 344068 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 long long 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[16*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<lli> v;
  unordered_map<lli,lli> m;
  ii s[n];
  pair<ii,lli> qu[q];
  for(lli i=0;i<n;++i)
  {
    cin>>s[i].F>>s[i].S;
    v.insert(s[i].F);
    v.insert(s[i].F+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);
    v.insert(qu[i].S); 
  }
  auto it=v.begin();
  lli c=0,c1=0;
  while(it!=v.end())
  {
    m[(*it)]=c;
    c++;
    it++;
  }
  vector<ii> st[c];
  vector<iii> que[c];
  for(lli i=0;i<n;++i)
  {
    lli su=s[i].F+s[i].S;
    s[i].F=m[s[i].F];
    st[m[su]].pb(mp(s[i].F,s[i].S));
  }
  for(lli i=0;i<q;++i)
  {
    qu[i].F.F=m[qu[i].F.F];
    qu[i].S=m[qu[i].S];
    que[qu[i].S].pb(mp(i,mp(qu[i].F.F,qu[i].F.S)));
  }
  lli ans[q]={};
  for(lli i=c-1;i>=0;--i)
  {
    for(lli j=0;j<st[i].size();++j)
      up(0,0,c-1,st[i][j].F,st[i][j].S);
    for(lli j=0;j<que[i].size();++j)
      ans[que[i][j].F]=query(0,0,c-1,que[i][j].S.F,c-1,que[i][j].S.S);
  }
  for(lli i=0;i<q;++i)
    cout<<ans[i]<<endl;
  return(0);
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:98:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(lli j=0;j<st[i].size();++j)
                 ~^~~~~~~~~~~~~
examination.cpp:100:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(lli j=0;j<que[i].size();++j)
                 ~^~~~~~~~~~~~~~
examination.cpp:74:11: warning: unused variable 'c1' [-Wunused-variable]
   lli c=0,c1=0;
           ^~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 150648 KB Output is correct
2 Correct 128 ms 150648 KB Output is correct
3 Correct 126 ms 150648 KB Output is correct
4 Correct 136 ms 150648 KB Output is correct
5 Correct 131 ms 150648 KB Output is correct
6 Correct 130 ms 150648 KB Output is correct
7 Correct 166 ms 155512 KB Output is correct
8 Correct 177 ms 155512 KB Output is correct
9 Correct 168 ms 155384 KB Output is correct
10 Correct 156 ms 155384 KB Output is correct
11 Correct 154 ms 154360 KB Output is correct
12 Correct 142 ms 151992 KB Output is correct
13 Correct 157 ms 154872 KB Output is correct
14 Correct 155 ms 154872 KB Output is correct
15 Correct 157 ms 154872 KB Output is correct
16 Correct 158 ms 153896 KB Output is correct
17 Correct 156 ms 154872 KB Output is correct
18 Correct 138 ms 151544 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2632 ms 291672 KB Output is correct
2 Correct 2796 ms 291520 KB Output is correct
3 Correct 2971 ms 291544 KB Output is correct
4 Correct 1821 ms 284164 KB Output is correct
5 Correct 1445 ms 276492 KB Output is correct
6 Correct 720 ms 194848 KB Output is correct
7 Correct 2616 ms 289588 KB Output is correct
8 Correct 2794 ms 291680 KB Output is correct
9 Correct 2439 ms 289596 KB Output is correct
10 Correct 1371 ms 276096 KB Output is correct
11 Correct 1526 ms 282240 KB Output is correct
12 Correct 541 ms 178396 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2632 ms 291672 KB Output is correct
2 Correct 2796 ms 291520 KB Output is correct
3 Correct 2971 ms 291544 KB Output is correct
4 Correct 1821 ms 284164 KB Output is correct
5 Correct 1445 ms 276492 KB Output is correct
6 Correct 720 ms 194848 KB Output is correct
7 Correct 2616 ms 289588 KB Output is correct
8 Correct 2794 ms 291680 KB Output is correct
9 Correct 2439 ms 289596 KB Output is correct
10 Correct 1371 ms 276096 KB Output is correct
11 Correct 1526 ms 282240 KB Output is correct
12 Correct 541 ms 178396 KB Output is correct
13 Correct 2656 ms 298260 KB Output is correct
14 Correct 2745 ms 293688 KB Output is correct
15 Correct 2579 ms 293988 KB Output is correct
16 Correct 1731 ms 287752 KB Output is correct
17 Correct 1448 ms 285436 KB Output is correct
18 Correct 732 ms 196076 KB Output is correct
19 Correct 2660 ms 301060 KB Output is correct
20 Correct 2933 ms 298648 KB Output is correct
21 Correct 2425 ms 300856 KB Output is correct
22 Correct 1282 ms 277852 KB Output is correct
23 Correct 1488 ms 283664 KB Output is correct
24 Correct 544 ms 179292 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 150648 KB Output is correct
2 Correct 128 ms 150648 KB Output is correct
3 Correct 126 ms 150648 KB Output is correct
4 Correct 136 ms 150648 KB Output is correct
5 Correct 131 ms 150648 KB Output is correct
6 Correct 130 ms 150648 KB Output is correct
7 Correct 166 ms 155512 KB Output is correct
8 Correct 177 ms 155512 KB Output is correct
9 Correct 168 ms 155384 KB Output is correct
10 Correct 156 ms 155384 KB Output is correct
11 Correct 154 ms 154360 KB Output is correct
12 Correct 142 ms 151992 KB Output is correct
13 Correct 157 ms 154872 KB Output is correct
14 Correct 155 ms 154872 KB Output is correct
15 Correct 157 ms 154872 KB Output is correct
16 Correct 158 ms 153896 KB Output is correct
17 Correct 156 ms 154872 KB Output is correct
18 Correct 138 ms 151544 KB Output is correct
19 Correct 2632 ms 291672 KB Output is correct
20 Correct 2796 ms 291520 KB Output is correct
21 Correct 2971 ms 291544 KB Output is correct
22 Correct 1821 ms 284164 KB Output is correct
23 Correct 1445 ms 276492 KB Output is correct
24 Correct 720 ms 194848 KB Output is correct
25 Correct 2616 ms 289588 KB Output is correct
26 Correct 2794 ms 291680 KB Output is correct
27 Correct 2439 ms 289596 KB Output is correct
28 Correct 1371 ms 276096 KB Output is correct
29 Correct 1526 ms 282240 KB Output is correct
30 Correct 541 ms 178396 KB Output is correct
31 Correct 2656 ms 298260 KB Output is correct
32 Correct 2745 ms 293688 KB Output is correct
33 Correct 2579 ms 293988 KB Output is correct
34 Correct 1731 ms 287752 KB Output is correct
35 Correct 1448 ms 285436 KB Output is correct
36 Correct 732 ms 196076 KB Output is correct
37 Correct 2660 ms 301060 KB Output is correct
38 Correct 2933 ms 298648 KB Output is correct
39 Correct 2425 ms 300856 KB Output is correct
40 Correct 1282 ms 277852 KB Output is correct
41 Correct 1488 ms 283664 KB Output is correct
42 Correct 544 ms 179292 KB Output is correct
43 Execution timed out 3108 ms 344068 KB Time limit exceeded
44 Halted 0 ms 0 KB -