oj.uz

Submission #255829

# Submission time Handle Problem Language Result Execution time Memory
255829 2020-08-01T22:52:28 Z uacoder123 Examination (JOI19_examination) C++14
2 / 100
 3000 ms 237624 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[8*100000+1];
lli n,q,co=0;
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;
  multiset<pair<ii,ii>> se;
  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].S);
    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].F.S);
    v.insert(qu[i].S); 
  }
  auto it=v.begin();
  lli c=0,c1=0;
  while(it!=v.end())
  {
    m[(*it)]=c;
    c++;
    it++;
  }
  for(lli i=0;i<n;++i)
  {
    lli su=s[i].F+s[i].S;
    s[i].F=m[s[i].F];
    s[i].S=m[s[i].S];
    se.insert(mp(mp(s[i].F,q+11),mp(s[i].S,m[su])));
  }
  for(lli i=0;i<q;++i)
  {
    qu[i].F.S=m[qu[i].F.S];
    qu[i].F.F=m[qu[i].F.F];
    qu[i].S=m[qu[i].S];
    se.insert(mp(mp(qu[i].F.F,i),mp(qu[i].F.S,qu[i].S)));
  }
  auto it1=se.begin();
  vector<ii> st[c];
  vector<iii> que[c];
  while(it1!=se.end())
  {
    lli in=(*it1).S.S;
    if((*it1).F.S!=q+11)
      que[in].pb(mp((*it1).F.S,mp(c1,(*it1).S.F)));
    else
      st[in].pb(mp(c1,(*it1).S.F));
    it1++;
    c1++;
  }
  lli ans[q]={};
  for(lli i=c-1;i>=0;--i)
  {
    for(lli j=0;j<st[i].size();++j)
      up(0,0,c1-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,c1-1,que[i][j].S.F,c1-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:114:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(lli j=0;j<st[i].size();++j)
                 ~^~~~~~~~~~~~~
examination.cpp:116:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(lli j=0;j<que[i].size();++j)
                 ~^~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 75512 KB Output is correct
2 Correct 64 ms 75512 KB Output is correct
3 Correct 66 ms 75512 KB Output is correct
4 Correct 65 ms 75512 KB Output is correct
5 Correct 65 ms 75512 KB Output is correct
6 Correct 68 ms 75640 KB Output is correct
7 Correct 100 ms 81476 KB Output is correct
8 Correct 98 ms 81528 KB Output is correct
9 Correct 100 ms 81524 KB Output is correct
10 Correct 94 ms 80504 KB Output is correct
11 Correct 105 ms 80476 KB Output is correct
12 Correct 86 ms 78840 KB Output is correct
13 Correct 110 ms 81016 KB Output is correct
14 Correct 97 ms 81144 KB Output is correct
15 Correct 94 ms 81016 KB Output is correct
16 Correct 94 ms 79736 KB Output is correct
17 Correct 98 ms 80120 KB Output is correct
18 Correct 90 ms 78840 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2890 ms 237624 KB Output is correct
2 Execution timed out 3078 ms 237356 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2890 ms 237624 KB Output is correct
2 Execution timed out 3078 ms 237356 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 75512 KB Output is correct
2 Correct 64 ms 75512 KB Output is correct
3 Correct 66 ms 75512 KB Output is correct
4 Correct 65 ms 75512 KB Output is correct
5 Correct 65 ms 75512 KB Output is correct
6 Correct 68 ms 75640 KB Output is correct
7 Correct 100 ms 81476 KB Output is correct
8 Correct 98 ms 81528 KB Output is correct
9 Correct 100 ms 81524 KB Output is correct
10 Correct 94 ms 80504 KB Output is correct
11 Correct 105 ms 80476 KB Output is correct
12 Correct 86 ms 78840 KB Output is correct
13 Correct 110 ms 81016 KB Output is correct
14 Correct 97 ms 81144 KB Output is correct
15 Correct 94 ms 81016 KB Output is correct
16 Correct 94 ms 79736 KB Output is correct
17 Correct 98 ms 80120 KB Output is correct
18 Correct 90 ms 78840 KB Output is correct
19 Correct 2890 ms 237624 KB Output is correct
20 Execution timed out 3078 ms 237356 KB Time limit exceeded
21 Halted 0 ms 0 KB -