oj.uz

Submission #703480

# Submission time Handle Problem Language Result Execution time Memory
703480 2023-02-27T13:34:26 Z niter Let's Win the Election (JOI22_ho_t3) C++14
11 / 100
 2500 ms 340 KB 
#include <bits/stdc++.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define pii pair<int,int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define STL(i, x) for(auto &i:x) cout << i << " "; cout << "\n";
#define iNf 2147483647
using namespace std;

ostream& operator<<(ostream &os, pii XXX){
    cout << "[" << XXX.ff << ", " << XXX.ss << "]";
}
void db(){
    cout << "\n";
}
template<class T, class ...U>
void db(T XXX, U ...YYY){
    cout << XXX;  db(YYY...);
}

bool cmp_ff(pii XXX, pii YYY){
    return (XXX.ff != YYY.ff) ? (XXX.ff < YYY.ff) : (XXX.ss < YYY.ss);
}
bool cmp_ss(pii XXX, pii YYY){
    return (XXX.ss != YYY.ss) ? (XXX.ss < YYY.ss) : (XXX.ff > YYY.ff);
}

int main(){
    int n, k;
    cin >> n >> k;
    int a[505], b[505];
    vector<pii> org(n), dp;
    loop(i,0,n){
        cin >> a[i] >> b[i];
        if(b[i] == -1)
            b[i] = iNf;
        org[i] = mp(a[i], b[i]);
    }
    long double ans = (1e300), tmp_ans;
    int tmp_get, tmp_now;
    sort(org.begin(), org.end());
    do{
        //STL(i, org);
        loop(i,0,k+1){
            dp = org;
            tmp_ans = 0;
            tmp_get = 0;
            tmp_now = 1;
            loop(j,0,i){
                if(dp[j].ss == iNf) break;
                tmp_ans += (long double)dp[j].ss / tmp_now;
                dp[j].ff = iNf;
                dp[j].ss = iNf;
                tmp_get++;
                tmp_now++;
            }
    //        STL(i, dp);
    //        db(tmp_ans);
            sort(dp.begin(), dp.end(), cmp_ff);
            loop(j,0,n){
                if(tmp_get == k){
                    ans = min(ans, tmp_ans);
                    break;
                }
                tmp_ans += (long double)dp[j].ff / tmp_now;
                tmp_get++;
            }
            if(tmp_get == k)
                ans = min(ans, tmp_ans);
        }
    }while(next_permutation(org.begin(), org.end()));
    cout << fixed << setprecision(10) << ans << "\n";
    return 0;
}
/*
3
3
1 5
2 3
4 5
*/
/*
2 2
9 10
5 9
*/

Compilation message

Main.cpp: In function 'std::ostream& operator<<(std::ostream&, std::pair<int, int>)':
Main.cpp:14:1: warning: no return statement in function returning non-void [-Wreturn-type]
   14 | }
      | ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Execution timed out 2571 ms 212 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Execution timed out 2571 ms 212 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 4 ms 212 KB Output is correct
5 Correct 5 ms 212 KB Output is correct
6 Correct 6 ms 212 KB Output is correct
7 Correct 6 ms 340 KB Output is correct
8 Correct 4 ms 212 KB Output is correct
9 Correct 5 ms 212 KB Output is correct
10 Correct 5 ms 296 KB Output is correct
11 Correct 5 ms 300 KB Output is correct
12 Correct 5 ms 212 KB Output is correct
13 Correct 5 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 6 ms 212 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 4 ms 212 KB Output is correct
5 Correct 5 ms 212 KB Output is correct
6 Correct 6 ms 212 KB Output is correct
7 Correct 6 ms 340 KB Output is correct
8 Correct 4 ms 212 KB Output is correct
9 Correct 5 ms 212 KB Output is correct
10 Correct 5 ms 296 KB Output is correct
11 Correct 5 ms 300 KB Output is correct
12 Correct 5 ms 212 KB Output is correct
13 Correct 5 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 6 ms 212 KB Output is correct
16 Execution timed out 2544 ms 212 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 4 ms 212 KB Output is correct
5 Correct 5 ms 212 KB Output is correct
6 Correct 6 ms 212 KB Output is correct
7 Correct 6 ms 340 KB Output is correct
8 Correct 4 ms 212 KB Output is correct
9 Correct 5 ms 212 KB Output is correct
10 Correct 5 ms 296 KB Output is correct
11 Correct 5 ms 300 KB Output is correct
12 Correct 5 ms 212 KB Output is correct
13 Correct 5 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 6 ms 212 KB Output is correct
16 Execution timed out 2544 ms 212 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2537 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Execution timed out 2571 ms 212 KB Time limit exceeded
6 Halted 0 ms 0 KB -