oj.uz

답안 #364364

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
364364 2021-02-09T03:11:47 Z daniel920712 운세 보기 2 (JOI14_fortune_telling2) C++14
0 / 100
 3 ms 492 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <string.h>
#include <map>
#include <vector>

using namespace std;
long long x[200005],y[200005];
pair < long long , long long > all[200005];
vector < pair < pair < long long , long long > , pair < long long , long long > > > a,b;
bool F(pair < long long , long long > a,pair < long long , long long > b)
{
    if(a.first>b.first) return 1;
    if(a.first<b.first) return 0;
    while(1) ;
    return a.second<b.second;
}
int main()
{
    long long N,K,i,j,con,ok=0,ans=0,con2=0;
    scanf("%lld %lld",&N,&K);
    for(i=0;i<N;i++) scanf("%lld %lld",&x[i],&y[i]);
    for(i=1;i<=K;i++)
    {
        scanf("%lld",&all[i].first);
        all[i].second=i;
    }
    all[0].first=2e9;
    all[0].second=0;
    sort(all,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=0;
        for(j=0;j<i;j++) if(all[j].second>all[i].second&&all[j].first>all[i].first) con++;
        for(j=0;j<i;j++) if(all[j].first>all[i].first) con2++;
        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)));

            if(con%2==0)
            {
                a.push_back(make_pair(make_pair(all[i].first+1,all[i-1].first),make_pair(0,all[i].first)));
                b.push_back(make_pair(make_pair(0,all[i].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(0,all[i].first)));
                a.push_back(make_pair(make_pair(0,all[i].first),make_pair(all[i].first+1,all[i-1].first)));
            }
        }
    }
    for(i=0;i<N;i++)
    {
        ok=0;
        for(auto j:a) if(x[i]>=j.first.first&&x[i]<=j.first.second&&y[i]>=j.second.first&&y[i]<=j.second.second) ok+=1;
        for(auto j:b) if(x[i]>=j.first.first&&x[i]<=j.first.second&&y[i]>=j.second.first&&y[i]<=j.second.second) ok+=1e9;
        //printf("%lld\n",ok);
        if(ok==1) ans+=x[i];
        else if(ok==1000000000) ans+=y[i];
        else while(1);

    }
    printf("%lld\n",ans);
    return 0;
}

Compilation message

fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:24:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   24 |     scanf("%lld %lld",&N,&K);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
fortune_telling2.cpp:25:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |     for(i=0;i<N;i++) scanf("%lld %lld",&x[i],&y[i]);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
fortune_telling2.cpp:28:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |         scanf("%lld",&all[i].first);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 492 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 492 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 492 KB Output isn't correct
2 Halted 0 ms 0 KB -