oj.uz

답안 #806643

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
806643 2023-08-04T08:28:44 Z vjudge1 Let's Win the Election (JOI22_ho_t3) C++14
10 / 100
 1 ms 340 KB 
#include<bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fi first
#define se second
#define ll long long
#define ld double
using namespace std ;
const int N = 500 ;
bool flag1 ;
int n, k ;
bool us[N + 1] ;
int a[N + 1], b[N + 1], cnt[(1 << 20)] ;
ld abu = 1e9, dp[(1 << 20)][22] ;
void bfs()
{
    set<pair<ld, pair<int, int>>> s ;
    s.insert({0, {0, 1}}) ;
    while(s.size())
    {
        auto p = *s.begin() ;
        int in = p.se.fi, jn = p.se.se ;
        ld gr = jn ;
        s.erase(s.begin()) ;
        if(p.fi > dp[in][jn])
            continue ;
        if(cnt[in] == k)
            return ;
        for(int j = 0 ; j < n ; j++)
        {
            if(((1 << j) & in))
                continue ;
            if(p.fi + (ld)a[j + 1] / gr < dp[in ^ (1 << j)][jn])
            {
                dp[in ^ (1 << j)][jn] = p.fi + (ld)a[j + 1] / gr ;
                s.insert({p.fi + (ld)a[j + 1] / gr, {in ^ (1 << j), jn}}) ;
            }
            if(b[j + 1] >= a[j + 1] && p.fi + (ld)b[j + 1] / gr < dp[in ^ (1 << j)][jn + 1])
            {
                dp[in ^ (1 << j)][jn + 1] = p.fi + (ld)b[j + 1] / gr ;
                s.insert({p.fi + (ld)b[j + 1] / gr, {in ^ (1 << j), jn + 1}}) ;
            }
        }
    }
}
pair<pair<ld, ld>, int> p[N + 1] ;
void rec(int now, ld sum, ld cnt)
{
    if(now == k)
    {
        abu = min(abu, sum) ;
        return ;
    }
    for(int i = 1 ; i <= n ; i++)
    {
        if(us[i])
            continue ;
        us[i] ^= 1 ;
        rec(now + 1, sum + p[i].fi.fi / cnt, cnt) ;
        if(p[i].fi.se != -1)rec(now + 1, sum + p[i].fi.se / cnt, cnt + 1) ;
        us[i] ^= 1 ;
    }
}
signed main()
{
//    freopen("input.txt", "r", stdin) ;
    ios_base::sync_with_stdio( 0 ) ;
    cin.tie( 0 ) ;
    cout.tie( 0 ) ;
    cin >> n ;
    cin >> k ;
    for(int i = 1 ; i <= n ; i++)
    {
        cin >> a[i] >> b[i] ;
        p[i] = {{a[i], b[i]}, i} ;
        if(p[i].fi.se != -1 && p[i].fi.se != p[i].fi.fi)
            flag1 = 1 ;
    }
    if(!flag1)
    {
        ld ans = 1e9 ;
        vector<pair<pair<ld, ld>, int>> v_pos, v_neg ;
        for(int i = 1 ; i <= n ; i++)
        {
            if(p[i].fi.se == -1)
                v_neg.push_back(p[i]) ;
            else
                v_pos.push_back({{p[i].fi.se, p[i].fi.fi}, i}) ;
        }
        sort(v_pos.begin(), v_pos.end()) ;
        sort(v_neg.begin(), v_neg.end()) ;
        for(int i = -1 ; i < min(k, (int)v_pos.size()) ; i++)
        {
            int now = i + 1, uk1 = i + 1, uk2 = 0 ;
            ld sum = 0, cnt = 1 ;
            for(int j = 0 ; j <= i ; j++)
            {
                sum += v_pos[j].fi.fi / cnt ;
                cnt++ ;
            }
            while(now < k)
            {
                ld mn = 1e9 ;
                if(uk1 < v_pos.size())
                    mn = v_pos[uk1].fi.se ;
                if(uk2 < v_neg.size())
                    mn = min(mn, v_neg[uk2].fi.fi) ;
                sum += mn / cnt ;
                if(uk1 < v_pos.size() && mn == v_pos[uk1].fi.se)
                    uk1++ ;
                else
                    uk2++ ;
                now++ ;
            }
            ans = min(ans, sum) ;
        }
        cout << fixed << setprecision(11) << ans ;
        return 0 ;
    }
    if(n <= 20)
    {
        ld ans = 1e9 ;
        for(int i = 1 ; i < (1 << n) ; i++)
            for(int j = 0 ; j < n ; j++)
                dp[i][j] = 1e9, cnt[i] += ((i & (1 << j)) > 0) ;
        dp[0][1] = 0 ;
        bfs() ;
        for(int i = 1 ; i < (1 << n) ; i++)
        {
            if(cnt[i] != k)
                continue ;
            for(int j = 0 ; j < k ; j++)
                ans = min(dp[i][j], ans) ;
        }
        cout << fixed << setprecision(11) << ans ;
        return 0 ;
    }
    return 0 ;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:104:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<double, double>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |                 if(uk1 < v_pos.size())
      |                    ~~~~^~~~~~~~~~~~~~
Main.cpp:106:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<double, double>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |                 if(uk2 < v_neg.size())
      |                    ~~~~^~~~~~~~~~~~~~
Main.cpp:109:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<double, double>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |                 if(uk1 < v_pos.size() && mn == v_pos[uk1].fi.se)
      |                    ~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

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

Subtask #5
0 / 33.0

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

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Incorrect 1 ms 340 KB Output isn't correct
22 Halted 0 ms 0 KB -