oj.uz

답안 #316035

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
316035 2020-10-24T21:56:09 Z JovanK26 운세 보기 2 (JOI14_fortune_telling2) C++14
35 / 100
 178 ms 31284 KB 
 #include <bits/stdc++.h>

using namespace std;
long long n,k,sz;
long long a[200050];
long long b[200050];
long long t[200050];
long long bit[200050];
long long comp[600150];
pair<long long,long long> pos[200050];
vector<long long> v[800250];
void insrt(long long start,long long val,long long i,long long j,long long l,long long r)
{
    if(r<i || l>j)return;
    if(l>=i && r<=j)
    {
        v[start].push_back(val);
        return;
    }
    long long m=(l+r)/2;
    insrt(2*start+1,val,i,j,l,m);
    insrt(2*start+2,val,i,j,m+1,r);
}
void check(long long start,long long j,long long tt,long long l,long long r)
{
    for(long long i=0;i<v[start].size();i++)
    {
        if(pos[v[start][i]].first<0)
        {
            pos[v[start][i]].first=j;
        }
    }
    v[start].clear();
    if(r-l==0)return;
    long long m=(l+r)/2;
    if(tt<=m)check(2*start+1,j,tt,l,m);
    else
    {
       check(2*start+2,j,tt,m+1,r);
    }
    return;
}
void update(long long x)
{
    while(x<=sz)
    {
        bit[x]++;
        x+=(x & -x);
    }
}
long long sum(long long x)
{
    long long ss=0;
    while(x>0)
    {
        ss+=bit[x];
        x-=(x & -x);
    }
    return ss;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //ifstream fin("03-01.txt");
    //ofstream fout("01out.txt");
    cin >> n >> k;
    long long ind=0;
    for(long long i=0;i<n;i++)
    {
        cin >> a[i] >> b[i];
        comp[ind++]=a[i];
        comp[ind++]=b[i];
    }
    for(long long i=0;i<k;i++)
    {
        cin >> t[i];
        comp[ind++]=t[i];
    }
    sort(comp,comp+ind);
    sz=unique(comp,comp+ind)-comp;
    for(long long i=0;i<n;i++)
    {
        a[i]=lower_bound(comp,comp+sz,a[i])-comp;
        b[i]=lower_bound(comp,comp+sz,b[i])-comp;
        pos[i]=make_pair(-1,i);
        insrt(0,i,min(a[i],b[i]),max(a[i],b[i])-1,0,sz-1);
    }
    for(long long i=k-1;i>=0;i--)
    {
        t[i]=lower_bound(comp,comp+sz,t[i])-comp;
        check(0,i,t[i],0,sz-1);
    }
    sort(pos,pos+n);
    reverse(pos,pos+n);
    long long cur=k-1;
    long long br=0;
    long long rez=0;
    for(long long i=0;i<n;i++)
    {
        while(cur>pos[i].first)
        {
           update(t[cur--]+1);
           br++;
        }
        long long p=pos[i].second;
        long long num=(br-sum(max(a[p],b[p])))%2;
        long long st=cur>=0 ? (a[p]<b[p] ? 1 : 0) : 0;
        long long fin;
        if((num+st)%2==0)
        {
            fin=a[p];
        }
        else
        {
            fin=b[p];
        }
        rez+=comp[fin];
    }
    cout << rez;
    return 0;
}

Compilation message

fortune_telling2.cpp: In function 'void check(long long int, long long int, long long int, long long int, long long int)':
fortune_telling2.cpp:26:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for(long long i=0;i<v[start].size();i++)
      |                       ~^~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 19200 KB Output is correct
2 Correct 16 ms 19328 KB Output is correct
3 Correct 15 ms 19456 KB Output is correct
4 Correct 15 ms 19584 KB Output is correct
5 Correct 15 ms 19456 KB Output is correct
6 Correct 15 ms 19456 KB Output is correct
7 Correct 15 ms 19328 KB Output is correct
8 Correct 16 ms 19456 KB Output is correct
9 Correct 14 ms 19328 KB Output is correct
10 Correct 15 ms 19328 KB Output is correct
11 Correct 15 ms 19328 KB Output is correct
12 Correct 14 ms 19328 KB Output is correct
13 Correct 15 ms 19328 KB Output is correct

Subtask #2
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 19200 KB Output is correct
2 Correct 16 ms 19328 KB Output is correct
3 Correct 15 ms 19456 KB Output is correct
4 Correct 15 ms 19584 KB Output is correct
5 Correct 15 ms 19456 KB Output is correct
6 Correct 15 ms 19456 KB Output is correct
7 Correct 15 ms 19328 KB Output is correct
8 Correct 16 ms 19456 KB Output is correct
9 Correct 14 ms 19328 KB Output is correct
10 Correct 15 ms 19328 KB Output is correct
11 Correct 15 ms 19328 KB Output is correct
12 Correct 14 ms 19328 KB Output is correct
13 Correct 15 ms 19328 KB Output is correct
14 Correct 40 ms 22008 KB Output is correct
15 Correct 74 ms 24956 KB Output is correct
16 Correct 119 ms 27896 KB Output is correct
17 Correct 164 ms 31224 KB Output is correct
18 Correct 169 ms 31284 KB Output is correct
19 Correct 160 ms 30584 KB Output is correct
20 Correct 161 ms 30328 KB Output is correct
21 Correct 146 ms 29680 KB Output is correct
22 Correct 98 ms 30216 KB Output is correct
23 Correct 92 ms 28152 KB Output is correct
24 Correct 91 ms 28792 KB Output is correct
25 Correct 96 ms 29684 KB Output is correct
26 Correct 91 ms 25976 KB Output is correct
27 Correct 105 ms 26360 KB Output is correct
28 Correct 97 ms 27100 KB Output is correct
29 Correct 91 ms 24056 KB Output is correct

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 19200 KB Output is correct
2 Correct 16 ms 19328 KB Output is correct
3 Correct 15 ms 19456 KB Output is correct
4 Correct 15 ms 19584 KB Output is correct
5 Correct 15 ms 19456 KB Output is correct
6 Correct 15 ms 19456 KB Output is correct
7 Correct 15 ms 19328 KB Output is correct
8 Correct 16 ms 19456 KB Output is correct
9 Correct 14 ms 19328 KB Output is correct
10 Correct 15 ms 19328 KB Output is correct
11 Correct 15 ms 19328 KB Output is correct
12 Correct 14 ms 19328 KB Output is correct
13 Correct 15 ms 19328 KB Output is correct
14 Correct 40 ms 22008 KB Output is correct
15 Correct 74 ms 24956 KB Output is correct
16 Correct 119 ms 27896 KB Output is correct
17 Correct 164 ms 31224 KB Output is correct
18 Correct 169 ms 31284 KB Output is correct
19 Correct 160 ms 30584 KB Output is correct
20 Correct 161 ms 30328 KB Output is correct
21 Correct 146 ms 29680 KB Output is correct
22 Correct 98 ms 30216 KB Output is correct
23 Correct 92 ms 28152 KB Output is correct
24 Correct 91 ms 28792 KB Output is correct
25 Correct 96 ms 29684 KB Output is correct
26 Correct 91 ms 25976 KB Output is correct
27 Correct 105 ms 26360 KB Output is correct
28 Correct 97 ms 27100 KB Output is correct
29 Correct 91 ms 24056 KB Output is correct
30 Incorrect 178 ms 27088 KB Output isn't correct
31 Halted 0 ms 0 KB -