oj.uz

답안 #364517

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
364517 2021-02-09T11:55:17 Z daniel920712 운세 보기 2 (JOI14_fortune_telling2) C++14
35 / 100
 3000 ms 204580 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <string.h>
#include <map>
#include <vector>
#include <set>

using namespace std;
int x[200005],y[200005];
pair < int , int > all[200005];
vector < pair < pair < int , int > , pair < int , int > > > a,b;
bool F(pair < int , int > a,pair < int , int > b)
{
    if(a.first>b.first) return 1;
    if(a.first<b.first) return 0;
    return a.second<b.second;
}
set < int > vis;
map < int , int > cha;
set < int > have;
struct A
{
    int l,r;
    int nxl,nxr,nxt;
    int add;
    vector < pair < pair < int ,int > , int > > all;
}Node[50005*35+5];
struct B
{
    int l,r;
    int nxl,nxr;
    int con;
}Node2[1000005];
int now=1,now2=1;
void New(int l,int r,int a,int here)
{
    //if((l+r)<0) while(1);
    Node[here].l=l;
    Node[here].r=r;
    Node[here].add=0;
    Node[here].nxl=-1;
    Node[here].nxr=-1;
    Node[here].nxt=a;
}
void New2(int l,int r,int here)
{
    //if((l+r)<0) while(1);
    Node2[here].l=l;
    Node2[here].r=r;
    Node2[here].con=0;
    Node2[here].nxl=-1;
    Node2[here].nxr=-1;
}
int Find(int x,int y,int here)
{
    int t=0;
    if(here==-1) return 0;
    if(upper_bound(Node[here].all.begin(),Node[here].all.end(),make_pair(make_pair(y+1,(int) -1),(int) -1))==Node[here].all.begin()) t=0;
    else
    {

        auto a=*prev(upper_bound(Node[here].all.begin(),Node[here].all.end(),make_pair(make_pair(y+1,(int) -1),(int) -1)));
        if(a.first.first<=y&&a.first.second>=y) t+=a.second;
    }
    if(Node[here].l==Node[here].r) return t;
    if(x<=(Node[here].l+Node[here].r)/2) t+=Find(x,y,Node[here].nxl);
    else t+=Find(x,y,Node[here].nxr);

    return t;
}
int Find2(int l,int r,int here)
{
    int t=0;
    if(here==-1) return 0;
    t=0;
    if(l==Node2[here].l&&r==Node2[here].r) return Node2[here].con;
    if(r<=(Node2[here].l+Node2[here].r)/2) return Find2(l,r,Node2[here].nxl);
    else if(l>(Node2[here].l+Node2[here].r)/2) return Find2(l,r,Node2[here].nxr);
    else return Find2(l,(Node2[here].l+Node2[here].r)/2,Node2[here].nxl)+Find2((Node2[here].l+Node2[here].r)/2+1,r,Node2[here].nxr);
}
void add2(int where,int here)
{
    Node2[here].con++;
    if(where==Node2[here].l&&where==Node2[here].r) return;
    if(where<=(Node2[here].l+Node2[here].r)/2)
    {
        if(Node2[here].nxl==-1)
        {
            Node2[here].nxl=now2++;
            New2(Node2[here].l,(Node2[here].l+Node2[here].r)/2,Node2[here].nxl);
        }
        add2(where,Node2[here].nxl);
    }
    else
    {
        if(Node2[here].nxr==-1)
        {
            Node2[here].nxr=now2++;
            New2((Node2[here].l+Node2[here].r)/2+1,Node2[here].r,Node2[here].nxr);
        }
        add2(where,Node2[here].nxr);
    }

}
void add(int l1,int r1,int l2,int r2,int con,int here)
{
    int t;

    if(l1==Node[here].l&&r1==Node[here].r)
    {
        Node[here].all.push_back(make_pair(make_pair(l2,r2),con));
        return;
    }
    if(r1<=(Node[here].l+Node[here].r)/2)
    {
        if(Node[here].nxl==-1)
        {
            Node[here].nxl=now++;
            New(Node[here].l,(Node[here].l+Node[here].r)/2,-1,Node[here].nxl);
        }
        add(l1,r1,l2,r2,con,Node[here].nxl);
    }
    else if(l1>(Node[here].l+Node[here].r)/2)
    {
        if(Node[here].nxr==-1)
        {
            Node[here].nxr=now++;
            New((Node[here].l+Node[here].r)/2+1,Node[here].r,-1,Node[here].nxr);
        }
        add(l1,r1,l2,r2,con,Node[here].nxr);
    }
    else
    {
        if(Node[here].nxl==-1)
        {
            Node[here].nxl=now++;
            New(Node[here].l,(Node[here].l+Node[here].r)/2,-1,Node[here].nxl);
        }
        add(l1,(Node[here].l+Node[here].r)/2,l2,r2,con,Node[here].nxl);
        if(Node[here].nxr==-1)
        {
            Node[here].nxr=now++;
            New((Node[here].l+Node[here].r)/2+1,Node[here].r,-1,Node[here].nxr);
        }
        add((Node[here].l+Node[here].r)/2+1,r1,l2,r2,con,Node[here].nxr);

    }
}
void BFS(int here)
{
    if(here==-1) return ;
    sort(Node[here].all.begin(),Node[here].all.end());
    BFS(Node[here].nxl);
    BFS(Node[here].nxr);
}
int main()
{
    int N,K,i,j,con,ok=0,con2=0,tt,tt2,ttt=0;
    long long ans=0;
    scanf("%d %d",&N,&K);
    have.insert(1e9+5);
    have.insert(1e9+6);
    have.insert(0);
    have.insert(1);
    New(0,1e6+5,-1,0);
    New2(0,1e6+5,0);
    for(i=0;i<N;i++)
    {
        scanf("%d %d",&x[i],&y[i]);
        have.insert(x[i]);
        have.insert(y[i]);
    }
    for(i=1;i<=K;i++)
    {
        scanf("%d",&all[i].first);
        have.insert(all[i].first);
        have.insert(all[i].first+1);
        all[i].second=i;
    }
    vis.insert(0);
    vis.insert(1e9+5);

    for(auto i:have) cha[i]=ttt++;

    for(i=K;i>=1;i--)
    {
        con=0;
        con2=0;
        con=Find2(cha[all[i].first+1],cha[1e9+5],0);

        if(vis.find(all[i].first)!=vis.end())
        {
            add2(cha[all[i].first],0);
            continue;
        }
        //printf("%lld\n",all[j])
        //if(con!=con2) return 1;
        tt=*vis.upper_bound(all[i].first);
        tt2=*prev(vis.upper_bound(all[i].first));
        if(con%2==0)
        {
            a.push_back(make_pair(make_pair(cha[all[i].first+1],cha[tt]),make_pair(cha[tt2+1],cha[all[i].first])));
            b.push_back(make_pair(make_pair(cha[tt2+1],cha[all[i].first]),make_pair(cha[all[i].first+1],cha[tt])));
        }
        else
        {
            b.push_back(make_pair(make_pair(cha[all[i].first+1],cha[tt]),make_pair(cha[tt2+1],cha[all[i].first])));
            a.push_back(make_pair(make_pair(cha[tt2+1],cha[all[i].first]),make_pair(cha[all[i].first+1],cha[tt])));
        }
        vis.insert(all[i].first);
        add2(cha[all[i].first],0);

    }

    all[0].first=1e9+5;
    all[0].second=0;
    sort(all+1,all+K+1,F);
    all[K+1].first=0;
    all[K+1].second=K+1;
    for(i=1;i<=K+1;i++)
    {
        con=0;
        con2=i;

        if(all[i].first!=all[i-1].first)
        {
            if(con2%2==1) a.push_back(make_pair(make_pair(cha[all[i].first+1],cha[all[i-1].first]),make_pair(cha[all[i].first+1],cha[all[i-1].first])));
            else b.push_back(make_pair(make_pair(cha[all[i].first+1],cha[all[i-1].first]),make_pair(cha[all[i].first+1],cha[all[i-1].first])));

        }
    }

    for(auto j:a) add(j.first.first,j.first.second,j.second.first,j.second.second,1,0);

    for(auto j:b) add(j.first.first,j.first.second,j.second.first,j.second.second,1e9,0);

    BFS(0);


    for(i=0;i<N;i++)
    {
        ok=0;
        ok=Find(cha[x[i]],cha[y[i]],0);
        if(ok==1000000000) ans+=(long long)y[i];
        else if(ok==1) ans+=(long long)x[i];
        else while(1);
    }
    printf("%lld\n",ans);

    return 0;
}

Compilation message

fortune_telling2.cpp: In function 'int Find2(int, int, int)':
fortune_telling2.cpp:76:9: warning: variable 't' set but not used [-Wunused-but-set-variable]
   76 |     int t=0;
      |         ^
fortune_telling2.cpp: In function 'void add(int, int, int, int, int, int)':
fortune_telling2.cpp:110:9: warning: unused variable 't' [-Wunused-variable]
  110 |     int t;
      |         ^
fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:161:15: warning: unused variable 'j' [-Wunused-variable]
  161 |     int N,K,i,j,con,ok=0,con2=0,tt,tt2,ttt=0;
      |               ^
fortune_telling2.cpp:163:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  163 |     scanf("%d %d",&N,&K);
      |     ~~~~~^~~~~~~~~~~~~~~
fortune_telling2.cpp:172:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  172 |         scanf("%d %d",&x[i],&y[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~
fortune_telling2.cpp:178:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  178 |         scanf("%d",&all[i].first);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 83052 KB Output is correct
2 Correct 61 ms 83180 KB Output is correct
3 Correct 54 ms 83308 KB Output is correct
4 Correct 54 ms 83308 KB Output is correct
5 Correct 59 ms 83436 KB Output is correct
6 Correct 54 ms 83308 KB Output is correct
7 Correct 62 ms 83436 KB Output is correct
8 Correct 53 ms 83308 KB Output is correct
9 Correct 52 ms 83180 KB Output is correct
10 Correct 51 ms 82796 KB Output is correct
11 Correct 54 ms 83180 KB Output is correct
12 Correct 53 ms 83180 KB Output is correct
13 Correct 54 ms 83180 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 83052 KB Output is correct
2 Correct 61 ms 83180 KB Output is correct
3 Correct 54 ms 83308 KB Output is correct
4 Correct 54 ms 83308 KB Output is correct
5 Correct 59 ms 83436 KB Output is correct
6 Correct 54 ms 83308 KB Output is correct
7 Correct 62 ms 83436 KB Output is correct
8 Correct 53 ms 83308 KB Output is correct
9 Correct 52 ms 83180 KB Output is correct
10 Correct 51 ms 82796 KB Output is correct
11 Correct 54 ms 83180 KB Output is correct
12 Correct 53 ms 83180 KB Output is correct
13 Correct 54 ms 83180 KB Output is correct
14 Correct 140 ms 89828 KB Output is correct
15 Correct 275 ms 97092 KB Output is correct
16 Correct 451 ms 104540 KB Output is correct
17 Correct 598 ms 111700 KB Output is correct
18 Correct 609 ms 111700 KB Output is correct
19 Correct 580 ms 111572 KB Output is correct
20 Correct 605 ms 111572 KB Output is correct
21 Correct 562 ms 110804 KB Output is correct
22 Correct 374 ms 99796 KB Output is correct
23 Correct 317 ms 96860 KB Output is correct
24 Correct 300 ms 94164 KB Output is correct
25 Correct 399 ms 102740 KB Output is correct
26 Correct 451 ms 105940 KB Output is correct
27 Correct 496 ms 106836 KB Output is correct
28 Correct 442 ms 106708 KB Output is correct
29 Correct 546 ms 109276 KB Output is correct

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 83052 KB Output is correct
2 Correct 61 ms 83180 KB Output is correct
3 Correct 54 ms 83308 KB Output is correct
4 Correct 54 ms 83308 KB Output is correct
5 Correct 59 ms 83436 KB Output is correct
6 Correct 54 ms 83308 KB Output is correct
7 Correct 62 ms 83436 KB Output is correct
8 Correct 53 ms 83308 KB Output is correct
9 Correct 52 ms 83180 KB Output is correct
10 Correct 51 ms 82796 KB Output is correct
11 Correct 54 ms 83180 KB Output is correct
12 Correct 53 ms 83180 KB Output is correct
13 Correct 54 ms 83180 KB Output is correct
14 Correct 140 ms 89828 KB Output is correct
15 Correct 275 ms 97092 KB Output is correct
16 Correct 451 ms 104540 KB Output is correct
17 Correct 598 ms 111700 KB Output is correct
18 Correct 609 ms 111700 KB Output is correct
19 Correct 580 ms 111572 KB Output is correct
20 Correct 605 ms 111572 KB Output is correct
21 Correct 562 ms 110804 KB Output is correct
22 Correct 374 ms 99796 KB Output is correct
23 Correct 317 ms 96860 KB Output is correct
24 Correct 300 ms 94164 KB Output is correct
25 Correct 399 ms 102740 KB Output is correct
26 Correct 451 ms 105940 KB Output is correct
27 Correct 496 ms 106836 KB Output is correct
28 Correct 442 ms 106708 KB Output is correct
29 Correct 546 ms 109276 KB Output is correct
30 Correct 2407 ms 180260 KB Output is correct
31 Correct 2740 ms 192036 KB Output is correct
32 Execution timed out 3103 ms 204580 KB Time limit exceeded
33 Halted 0 ms 0 KB -