oj.uz

답안 #772065

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
772065 2023-07-03T15:09:31 Z HoriaHaivas San (COCI17_san) C++14
48 / 120
 145 ms 16756 KB 
/*
    "TLE is like the wind, always by my side"
    - Yasuo - 2022 -
*/
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast")
#define int long long

using namespace std;

struct cladire
{
    int h;
    int g;
    int poz;
};

struct subsirhigh
{
    int sum;
    int highest;
};

struct subsirlow
{
    int sum;
    int lowest;
};

cladire building[42];
int aib[42]; /// praise the data structure
///count the inversions
vector<subsirhigh> firsthalf;
vector<subsirlow> secondhalf;
int n,k,i,j,val,ans,r,pas,ree,calculated;

bool cmp (cladire a, cladire b)
{
    return a.h<b.h;
}

bool cmp2(subsirhigh a, subsirhigh b)
{
    return a.sum<b.sum;
}

bool cmp3(cladire a, cladire b)
{
    return a.poz<b.poz;
}

bool cmp4(subsirlow a, subsirlow b)
{
    return a.sum<b.sum;
}

void gen(int r)
{
    int mask,currsum,currhighest,j;
    bool ok;
    for (mask=1; mask<(1<<r); mask++)
    {
        ok=true;
        currsum=0;
        currhighest=-1;
        for (j=0; j<r && ok; j++)
        {
            if (mask&(1<<j))
            {
                if (building[j+1].h>=currhighest)
                {
                    currsum+=building[j+1].g;
                    currhighest=building[j+1].h;
                }
                else
                {
                    ok=false;
                }
            }
        }
        if (ok)
        {
            if (currsum>=k)
                ans++;
            firsthalf.push_back({currsum,currhighest});
        }
    }
}

void gen2(int r)
{
    int mask,j,currsum,currhighest,currlowest;
    bool ok;
    for (mask=1; mask<(1<<r); mask++)
    {
        ok=true;
        currsum=0;
        currhighest=0;
        currlowest=n+1;
        for (j=0; j<r && ok; j++)
        {
            if (mask&(1<<j))
            {
                if (building[j+n/2+1].h>=currhighest)
                {
                    currsum+=building[j+n/2+1].g;
                    currhighest=building[j+n/2+1].h;
                    currlowest=min(currlowest,building[j+n/2+1].h);
                }
                else
                {
                    ok=false;
                }
            }
        }
        if (ok)
        {
            if (currsum>=k)
                ans++;
            secondhalf.push_back({currsum,currlowest});
        }
    }
}

void update(int index, int delta)
{
    while (index<=n)
    {
        aib[index]+=delta;
        index+=index&(-index);
    }
}

int query(int index)
{
    int s;
    s=0;
    while (index>0)
    {
         s+=aib[index];
         index-=index&(-index);
    }
    return s;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> k;
    for (i=1; i<=n; i++)
    {
        cin >> building[i].h >> building[i].g;
        building[i].poz=i;
    }
    sort(building+1,building+1+n,cmp);
    val=0;
    for (i=1; i<=n; i++)
    {
        if (i==1 || building[i].h!=building[i-1].h)
            val++;
        building[i].h=val;
    }
    sort(building+1,building+1+n,cmp3);
    ans=0;
    gen(n/2);
    sort(firsthalf.begin(),firsthalf.end(),cmp2);
    gen2(n/2);
    sort(secondhalf.begin(),secondhalf.end(),cmp4);
    calculated=firsthalf.size()-1;
    for (i=0;i<secondhalf.size();i++)
    {
         r=0;
         pas=(1<<20);
         while (pas)
         {
              if (r+pas<firsthalf.size() && secondhalf[i].sum+firsthalf[r+pas].sum<k)
                  r+=pas;
              pas=pas/2;
         }
         if(secondhalf[i].sum+firsthalf[r].sum<k)
            r++;
         if (r!=firsthalf.size())
         {
            while (calculated>=r)
            {
                   update(firsthalf[calculated].highest,1);
                   calculated--;
            }
            ans+=query(secondhalf[i].lowest);
         }
    }
    cout << ans;
}

Compilation message

san.cpp: In function 'int main()':
san.cpp:174:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<subsirlow>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  174 |     for (i=0;i<secondhalf.size();i++)
      |              ~^~~~~~~~~~~~~~~~~~
san.cpp:180:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<subsirhigh>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  180 |               if (r+pas<firsthalf.size() && secondhalf[i].sum+firsthalf[r+pas].sum<k)
      |                   ~~~~~^~~~~~~~~~~~~~~~~
san.cpp:186:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<subsirhigh>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  186 |          if (r!=firsthalf.size())
      |              ~^~~~~~~~~~~~~~~~~~

Subtask #1
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 324 KB Output is correct

Subtask #3
0 / 24.0

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

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 5224 KB Output is correct
2 Incorrect 12 ms 908 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

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