oj.uz

답안 #315972

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

using namespace std;
int n,k,sz;
int a[200500];
int b[200500];
int t[200000];
int bit[200500];
int comp[600500];
pair<int,int> pos[200500];
vector<int> v[805000];
void insrt(int start,int val,int i,int j,int l,int r)
{
    if(i==l && j==r)
    {
        v[start].push_back(val);
        return;
    }
    int m=(l+r)/2;
    if(i<m)insrt(2*start,val,i,min(j,m),l,m);
    if(j>m)insrt(2*start+1,val,max(i,m),j,m,r);
}
void check(int start,int j,int tt,int l,int r)
{
    for(int 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==1)return;
    int m=(l+r)/2;
    if(tt<m)check(2*start,j,tt,l,m);
    else
    {
       check(2*start+1,j,tt,m,r);
    }
}
void update(int x)
{
    while(x<=sz)
    {
        bit[x]++;
        x+=x&(-x);
    }
}
int sum(int x)
{
    int rez=0;
    while(x>0)
    {
        rez+=bit[x];
        x-=x&(-x);
    }
    return rez;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> k;
    int ind=0;
    for(int i=0;i<n;i++)
    {
        cin >> a[i] >> b[i];
        comp[ind++]=a[i];
        comp[ind++]=b[i];
    }
    for(int i=0;i<k;i++)
    {
        cin >> t[i];
        comp[ind++]=t[i];
    }
    sort(comp,comp+ind);
    sz=unique(comp,comp+ind)-comp;
    for(int 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(1,i,min(a[i],b[i]),max(a[i],b[i]),0,sz);
    }
    for(int i=k-1;i>=0;i--)
    {
        t[i]=lower_bound(comp,comp+sz,t[i])-comp;
        check(1,i,t[i],0,sz);
    }
    sort(pos,pos+n);
    reverse(pos,pos+n);
    int cur=k-1;
    int br=0;
    long long rez=0;
    for(int i=0;i<n;i++)
    {
        while(cur>pos[i].first)
        {
           update(t[cur--]+1);
           br++;
        }
        int p=pos[i].second;
        int num=(br-sum(b[p]))%2;
        int beg=1;
        if(cur<0)beg=0;
        else
        {
            beg=a[p]<b[p];
        }
        int fin=a[p];
        if((num+beg)%2)
        {
            fin=b[p];
        }
        rez+=comp[fin];
    }
    cout << rez;
    return 0;
}

Compilation message

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

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 19328 KB Output is correct
2 Correct 14 ms 19328 KB Output is correct
3 Correct 15 ms 19456 KB Output is correct
4 Correct 15 ms 19456 KB Output is correct
5 Correct 15 ms 19456 KB Output is correct
6 Correct 16 ms 19456 KB Output is correct
7 Correct 15 ms 19456 KB Output is correct
8 Correct 15 ms 19456 KB Output is correct
9 Correct 15 ms 19456 KB Output is correct
10 Correct 14 ms 19328 KB Output is correct
11 Correct 15 ms 19328 KB Output is correct
12 Correct 15 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 19328 KB Output is correct
2 Correct 14 ms 19328 KB Output is correct
3 Correct 15 ms 19456 KB Output is correct
4 Correct 15 ms 19456 KB Output is correct
5 Correct 15 ms 19456 KB Output is correct
6 Correct 16 ms 19456 KB Output is correct
7 Correct 15 ms 19456 KB Output is correct
8 Correct 15 ms 19456 KB Output is correct
9 Correct 15 ms 19456 KB Output is correct
10 Correct 14 ms 19328 KB Output is correct
11 Correct 15 ms 19328 KB Output is correct
12 Correct 15 ms 19328 KB Output is correct
13 Correct 15 ms 19328 KB Output is correct
14 Correct 37 ms 21112 KB Output is correct
15 Correct 68 ms 23032 KB Output is correct
16 Correct 110 ms 25084 KB Output is correct
17 Correct 151 ms 27040 KB Output is correct
18 Correct 147 ms 27000 KB Output is correct
19 Correct 143 ms 26616 KB Output is correct
20 Correct 141 ms 26616 KB Output is correct
21 Correct 134 ms 25720 KB Output is correct
22 Correct 93 ms 25848 KB Output is correct
23 Correct 86 ms 24824 KB Output is correct
24 Correct 86 ms 25208 KB Output is correct
25 Correct 91 ms 25720 KB Output is correct
26 Correct 83 ms 23288 KB Output is correct
27 Correct 98 ms 23544 KB Output is correct
28 Correct 94 ms 24444 KB Output is correct
29 Correct 88 ms 22392 KB Output is correct

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 19328 KB Output is correct
2 Correct 14 ms 19328 KB Output is correct
3 Correct 15 ms 19456 KB Output is correct
4 Correct 15 ms 19456 KB Output is correct
5 Correct 15 ms 19456 KB Output is correct
6 Correct 16 ms 19456 KB Output is correct
7 Correct 15 ms 19456 KB Output is correct
8 Correct 15 ms 19456 KB Output is correct
9 Correct 15 ms 19456 KB Output is correct
10 Correct 14 ms 19328 KB Output is correct
11 Correct 15 ms 19328 KB Output is correct
12 Correct 15 ms 19328 KB Output is correct
13 Correct 15 ms 19328 KB Output is correct
14 Correct 37 ms 21112 KB Output is correct
15 Correct 68 ms 23032 KB Output is correct
16 Correct 110 ms 25084 KB Output is correct
17 Correct 151 ms 27040 KB Output is correct
18 Correct 147 ms 27000 KB Output is correct
19 Correct 143 ms 26616 KB Output is correct
20 Correct 141 ms 26616 KB Output is correct
21 Correct 134 ms 25720 KB Output is correct
22 Correct 93 ms 25848 KB Output is correct
23 Correct 86 ms 24824 KB Output is correct
24 Correct 86 ms 25208 KB Output is correct
25 Correct 91 ms 25720 KB Output is correct
26 Correct 83 ms 23288 KB Output is correct
27 Correct 98 ms 23544 KB Output is correct
28 Correct 94 ms 24444 KB Output is correct
29 Correct 88 ms 22392 KB Output is correct
30 Incorrect 176 ms 24056 KB Output isn't correct
31 Halted 0 ms 0 KB -