oj.uz

답안 #824374

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824374 2023-08-14T04:50:09 Z peteza Let's Win the Election (JOI22_ho_t3) C++14
5 / 100
 2500 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;

bool vis[505];
int n, k;
int as, bs;
vector<pair<int, int>> a, b;

int todo=0,ptr=0;
long double ans = 1e18, csum = 0;

int main() {
    cin >> n >> k;
    for(int i=0;i<n;i++) {
        cin >> as >> bs;
        a.emplace_back(as, i);
        b.emplace_back(bs==-1 ? INT_MAX :bs, i);
    }
    sort(a.begin(), a.end()); sort(b.begin(), b.end());
    for(int selb=0;selb<=b.size();selb++) {
        vector<bool> vis(n, 0);
        todo = k; csum = 0; ptr = 0;
        bool broke = 0;
        for(int i=0;i<selb;i++) {
            if(b[i].first == INT_MAX) broke = 1;
            vis[b[i].second] = 1;
            csum += 1.00*b[i].first/(i+1); todo--;
        }
        if(broke) break;
        while(todo > 0){
            if(vis[a[ptr].second]) continue;
            csum += 1.00*a[ptr].first/(selb+1);
            todo--; ptr++;
        }
        ans = min(ans, csum);
    }
    cout << ans;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:20:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int selb=0;selb<=b.size();selb++) {
      |                    ~~~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Execution timed out 2530 ms 212 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Execution timed out 2538 ms 212 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Execution timed out 2538 ms 212 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Execution timed out 2538 ms 212 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2548 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Execution timed out 2530 ms 212 KB Time limit exceeded
13 Halted 0 ms 0 KB -