oj.uz

답안 #255843

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
255843 2020-08-02T00:15:59 Z uacoder123 Examination (JOI19_examination) C++14
43 / 100
 3000 ms 250968 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,c1=0;
      auto it1=v1.begin();
      while(it1!=v1.end())
      {
        m1[(*it1)]=c1;
        c1++;
        it1++;
      }
      c=0;
      while(it!=v.end())
      {
        m[(*it)]=c;
        c++;
        it++;
      }
      vector<ii> st[c1];
      vector<iii> que[c1];
      for(lli i=0;i<n;++i)
      {
        lli su=s[i].F*1LL+s[i].S;
        s[i].F=m[s[i].F];
        st[m1[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=m1[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=c1-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]<<'\n';
      return(0);
    }

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:106:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(lli j=0;j<st[i].size();++j)
                     ~^~~~~~~~~~~~~
examination.cpp:108:22: 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

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 75512 KB Output is correct
2 Correct 65 ms 75536 KB Output is correct
3 Correct 63 ms 75512 KB Output is correct
4 Correct 72 ms 75448 KB Output is correct
5 Correct 65 ms 75512 KB Output is correct
6 Correct 64 ms 75512 KB Output is correct
7 Correct 92 ms 79608 KB Output is correct
8 Correct 93 ms 79612 KB Output is correct
9 Correct 88 ms 79608 KB Output is correct
10 Correct 88 ms 79608 KB Output is correct
11 Correct 74 ms 77472 KB Output is correct
12 Correct 73 ms 76536 KB Output is correct
13 Correct 82 ms 79224 KB Output is correct
14 Correct 85 ms 79224 KB Output is correct
15 Correct 82 ms 79224 KB Output is correct
16 Correct 68 ms 76408 KB Output is correct
17 Correct 82 ms 79608 KB Output is correct
18 Correct 68 ms 76152 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2283 ms 209728 KB Output is correct
2 Correct 2486 ms 209592 KB Output is correct
3 Correct 2591 ms 209596 KB Output is correct
4 Correct 1566 ms 208260 KB Output is correct
5 Correct 549 ms 119376 KB Output is correct
6 Correct 441 ms 109356 KB Output is correct
7 Correct 2339 ms 205236 KB Output is correct
8 Correct 2134 ms 209520 KB Output is correct
9 Correct 1852 ms 205332 KB Output is correct
10 Correct 279 ms 103248 KB Output is correct
11 Correct 1238 ms 207744 KB Output is correct
12 Correct 339 ms 99208 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2283 ms 209728 KB Output is correct
2 Correct 2486 ms 209592 KB Output is correct
3 Correct 2591 ms 209596 KB Output is correct
4 Correct 1566 ms 208260 KB Output is correct
5 Correct 549 ms 119376 KB Output is correct
6 Correct 441 ms 109356 KB Output is correct
7 Correct 2339 ms 205236 KB Output is correct
8 Correct 2134 ms 209520 KB Output is correct
9 Correct 1852 ms 205332 KB Output is correct
10 Correct 279 ms 103248 KB Output is correct
11 Correct 1238 ms 207744 KB Output is correct
12 Correct 339 ms 99208 KB Output is correct
13 Correct 2505 ms 218164 KB Output is correct
14 Correct 2431 ms 216588 KB Output is correct
15 Correct 2247 ms 209604 KB Output is correct
16 Correct 1609 ms 212004 KB Output is correct
17 Correct 613 ms 123364 KB Output is correct
18 Correct 447 ms 109544 KB Output is correct
19 Correct 2919 ms 217912 KB Output is correct
20 Correct 2289 ms 217164 KB Output is correct
21 Correct 2312 ms 216888 KB Output is correct
22 Correct 271 ms 103300 KB Output is correct
23 Correct 1372 ms 207932 KB Output is correct
24 Correct 342 ms 99176 KB Output is correct

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 75512 KB Output is correct
2 Correct 65 ms 75536 KB Output is correct
3 Correct 63 ms 75512 KB Output is correct
4 Correct 72 ms 75448 KB Output is correct
5 Correct 65 ms 75512 KB Output is correct
6 Correct 64 ms 75512 KB Output is correct
7 Correct 92 ms 79608 KB Output is correct
8 Correct 93 ms 79612 KB Output is correct
9 Correct 88 ms 79608 KB Output is correct
10 Correct 88 ms 79608 KB Output is correct
11 Correct 74 ms 77472 KB Output is correct
12 Correct 73 ms 76536 KB Output is correct
13 Correct 82 ms 79224 KB Output is correct
14 Correct 85 ms 79224 KB Output is correct
15 Correct 82 ms 79224 KB Output is correct
16 Correct 68 ms 76408 KB Output is correct
17 Correct 82 ms 79608 KB Output is correct
18 Correct 68 ms 76152 KB Output is correct
19 Correct 2283 ms 209728 KB Output is correct
20 Correct 2486 ms 209592 KB Output is correct
21 Correct 2591 ms 209596 KB Output is correct
22 Correct 1566 ms 208260 KB Output is correct
23 Correct 549 ms 119376 KB Output is correct
24 Correct 441 ms 109356 KB Output is correct
25 Correct 2339 ms 205236 KB Output is correct
26 Correct 2134 ms 209520 KB Output is correct
27 Correct 1852 ms 205332 KB Output is correct
28 Correct 279 ms 103248 KB Output is correct
29 Correct 1238 ms 207744 KB Output is correct
30 Correct 339 ms 99208 KB Output is correct
31 Correct 2505 ms 218164 KB Output is correct
32 Correct 2431 ms 216588 KB Output is correct
33 Correct 2247 ms 209604 KB Output is correct
34 Correct 1609 ms 212004 KB Output is correct
35 Correct 613 ms 123364 KB Output is correct
36 Correct 447 ms 109544 KB Output is correct
37 Correct 2919 ms 217912 KB Output is correct
38 Correct 2289 ms 217164 KB Output is correct
39 Correct 2312 ms 216888 KB Output is correct
40 Correct 271 ms 103300 KB Output is correct
41 Correct 1372 ms 207932 KB Output is correct
42 Correct 342 ms 99176 KB Output is correct
43 Correct 2896 ms 246564 KB Output is correct
44 Correct 2745 ms 246316 KB Output is correct
45 Correct 2912 ms 246292 KB Output is correct
46 Correct 2167 ms 249552 KB Output is correct
47 Correct 729 ms 143544 KB Output is correct
48 Correct 367 ms 110456 KB Output is correct
49 Execution timed out 3111 ms 250968 KB Time limit exceeded
50 Halted 0 ms 0 KB -