oj.uz

답안 #364506

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
364506 2021-02-09T11:28:07 Z daniel920712 운세 보기 2 (JOI14_fortune_telling2) C++14
35 / 100
 3000 ms 133728 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;
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()
{
    //freopen("01-10.txt","rt",stdin);
    int N,K,i,j,con,ok=0,con2=0,tt,tt2;
    long long ans=0;
    scanf("%d %d",&N,&K);
    New(0,1e9+5,-1,0);
    New2(0,1e9+5,0);
    for(i=0;i<N;i++) scanf("%d %d",&x[i],&y[i]);
    for(i=1;i<=K;i++)
    {
        scanf("%d",&all[i].first);
        all[i].second=i;
    }
    vis.insert(0);
    vis.insert(1e9+5);

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

        if(vis.find(all[i].first)!=vis.end())
        {
            add2(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(con2%2==0)
        {
            a.push_back(make_pair(make_pair(all[i].first+1,tt),make_pair(tt2+1,all[i].first)));
            b.push_back(make_pair(make_pair(tt2+1,all[i].first),make_pair(all[i].first+1,tt)));
        }
        else
        {
            b.push_back(make_pair(make_pair(all[i].first+1,tt),make_pair(tt2+1,all[i].first)));
            a.push_back(make_pair(make_pair(tt2+1,all[i].first),make_pair(all[i].first+1,tt)));
        }
        vis.insert(all[i].first);
        add2(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(all[i].first+1,all[i-1].first),make_pair(all[i].first+1,all[i-1].first)));
            else b.push_back(make_pair(make_pair(all[i].first+1,all[i-1].first),make_pair(all[i].first+1,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(x[i],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:74:9: warning: variable 't' set but not used [-Wunused-but-set-variable]
   74 |     int t=0;
      |         ^
fortune_telling2.cpp: In function 'void add(int, int, int, int, int, int)':
fortune_telling2.cpp:108:9: warning: unused variable 't' [-Wunused-variable]
  108 |     int t;
      |         ^
fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:160:17: warning: variable 'con' set but not used [-Wunused-but-set-variable]
  160 |     int N,K,i,j,con,ok=0,con2=0,tt,tt2;
      |                 ^~~
fortune_telling2.cpp:162:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  162 |     scanf("%d %d",&N,&K);
      |     ~~~~~^~~~~~~~~~~~~~~
fortune_telling2.cpp:165:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  165 |     for(i=0;i<N;i++) scanf("%d %d",&x[i],&y[i]);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~~
fortune_telling2.cpp:168:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  168 |         scanf("%d",&all[i].first);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 84204 KB Output is correct
2 Correct 62 ms 84204 KB Output is correct
3 Correct 63 ms 84204 KB Output is correct
4 Correct 63 ms 84332 KB Output is correct
5 Correct 64 ms 84332 KB Output is correct
6 Correct 66 ms 84232 KB Output is correct
7 Correct 63 ms 84204 KB Output is correct
8 Correct 63 ms 84332 KB Output is correct
9 Correct 62 ms 84204 KB Output is correct
10 Correct 56 ms 82796 KB Output is correct
11 Correct 67 ms 84332 KB Output is correct
12 Correct 63 ms 84264 KB Output is correct
13 Correct 64 ms 84204 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 84204 KB Output is correct
2 Correct 62 ms 84204 KB Output is correct
3 Correct 63 ms 84204 KB Output is correct
4 Correct 63 ms 84332 KB Output is correct
5 Correct 64 ms 84332 KB Output is correct
6 Correct 66 ms 84232 KB Output is correct
7 Correct 63 ms 84204 KB Output is correct
8 Correct 63 ms 84332 KB Output is correct
9 Correct 62 ms 84204 KB Output is correct
10 Correct 56 ms 82796 KB Output is correct
11 Correct 67 ms 84332 KB Output is correct
12 Correct 63 ms 84264 KB Output is correct
13 Correct 64 ms 84204 KB Output is correct
14 Correct 230 ms 96624 KB Output is correct
15 Correct 511 ms 109276 KB Output is correct
16 Correct 907 ms 121328 KB Output is correct
17 Correct 1377 ms 133204 KB Output is correct
18 Correct 1400 ms 133728 KB Output is correct
19 Correct 1369 ms 133332 KB Output is correct
20 Correct 1408 ms 133108 KB Output is correct
21 Correct 1411 ms 133316 KB Output is correct
22 Correct 1024 ms 93132 KB Output is correct
23 Correct 986 ms 91876 KB Output is correct
24 Correct 981 ms 90708 KB Output is correct
25 Correct 1045 ms 94636 KB Output is correct
26 Correct 1353 ms 132436 KB Output is correct
27 Correct 1346 ms 133180 KB Output is correct
28 Correct 1347 ms 131412 KB Output is correct
29 Correct 1390 ms 133208 KB Output is correct

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 84204 KB Output is correct
2 Correct 62 ms 84204 KB Output is correct
3 Correct 63 ms 84204 KB Output is correct
4 Correct 63 ms 84332 KB Output is correct
5 Correct 64 ms 84332 KB Output is correct
6 Correct 66 ms 84232 KB Output is correct
7 Correct 63 ms 84204 KB Output is correct
8 Correct 63 ms 84332 KB Output is correct
9 Correct 62 ms 84204 KB Output is correct
10 Correct 56 ms 82796 KB Output is correct
11 Correct 67 ms 84332 KB Output is correct
12 Correct 63 ms 84264 KB Output is correct
13 Correct 64 ms 84204 KB Output is correct
14 Correct 230 ms 96624 KB Output is correct
15 Correct 511 ms 109276 KB Output is correct
16 Correct 907 ms 121328 KB Output is correct
17 Correct 1377 ms 133204 KB Output is correct
18 Correct 1400 ms 133728 KB Output is correct
19 Correct 1369 ms 133332 KB Output is correct
20 Correct 1408 ms 133108 KB Output is correct
21 Correct 1411 ms 133316 KB Output is correct
22 Correct 1024 ms 93132 KB Output is correct
23 Correct 986 ms 91876 KB Output is correct
24 Correct 981 ms 90708 KB Output is correct
25 Correct 1045 ms 94636 KB Output is correct
26 Correct 1353 ms 132436 KB Output is correct
27 Correct 1346 ms 133180 KB Output is correct
28 Correct 1347 ms 131412 KB Output is correct
29 Correct 1390 ms 133208 KB Output is correct
30 Execution timed out 3069 ms 111216 KB Time limit exceeded
31 Halted 0 ms 0 KB -