제출 #228675

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
228675		osaaateiasavtnl	Hiring (IOI09_hiring)	C++14	50 / 100	1591 ms	12264 KiB

hiring

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int N = 5e5 + 7;
int n, W;
struct Chel {
    int s, q, i;
} a[N];  
bool comp(Chel a, Chel b) {
    //return (a.s/a.q) < (b.s/b.q);
    return a.s * b.q < b.s * a.q;
}   
bool compq(int i, int j) {
    return a[i].q < a[j].q;
}   
bool ls(ii a, ii b) {
    return a.f * b.s < b.f * a.s;
}
signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    cin >> n >> W;
    for (int i = 0; i < n; ++i) {
        cin >> a[i].s >> a[i].q;
        a[i].i = i;
    }   
    sort(a, a + n, comp);
    vector <int> cur;

    int ans = 0;
    ii pay = {0, 1};

    vector <int> who;

    for (int i = 0; i < n; ++i) {
        cur.app(i);
        sort(all(cur), compq);

        int sum = 0;
        for (int j = 0; j < cur.size(); ++j) {
            sum += a[cur[j]].q;
            if (sum * a[i].s <= W * a[i].q) {
                ii np = mp(sum * a[i].s, a[i].q);
                if (j + 1 > ans || (j + 1 == ans && ls(np, pay))) {
                    ans = j + 1;
                    pay = np;
                    who = {};
                    for (int k = 0; k <= j; ++k) {
                        who.app(a[cur[k]].i);
                    }   
                }
            }   
        }   
    }   
    cout << ans << endl;
    for (int e : who)
        cout << e + 1 << ' ';
    cout << endl;
}

컴파일 시 표준 에러 (stderr) 메시지

hiring.cpp: In function 'int main()':
hiring.cpp:53:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < cur.size(); ++j) {
                         ~~^~~~~~~~~~~~

• Subtask 1: 20 / 30
• Subtask 2: 12 / 28
• Subtask 3: 6 / 6
• Subtask 4: 6 / 6
• Subtask 5: 6 / 6
• Subtask 6: 0 / 6
• Subtask 7: 0 / 6
• Subtask 8: 0 / 6
• Subtask 9: 0 / 6