답안 #593217

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
593217	2022-07-10T15:20:56 Z	nguyen31hoang08minh2003	Pod starim krovovima (COCI20_psk)	C++14	50 / 50	1 ms	340 KB

psk

/*
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
|////|\  /|\  /|\/\/|\/\/|\  /|\  /|\/ /|\ \/|\  /|\  /|\\\\|////|\  /|\  /|\/\/|\/\/|\  /|\  /|\/ /|\ \/|\  /|\  /|\\\\|////|\  /|\  /|
|/// | \/\|/\/ | \/\|/\/ | \//|\\/ | \/ | \/ | \/\|/\/ | \\\|/// | \/\|/\/ | \/\|/\/ | \//|\\/ | \/ | \/ | \/\|/\/ | \\\|/// | \/\|/\/ |
|//\ | /\ | /\ | /\/|\/\ | ///|\\\ | /\/|\/\ | /\/|\/\ | /\\|//\ | /\ | /\ | /\/|\/\ | ///|\\\ | /\/|\/\ | /\/|\/\ | /\\|//\ | /\ | /\ |
|/  \|/\ \|/ /\|/  \|/  \|////|\\\\|/  \|/  \|/\/\|/\/\|/  \|/  \|/\ \|/ /\|/  \|/  \|////|\\\\|/  \|/  \|/\/\|/\/\|/  \|/  \|/\ \|/ /\|
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
|\  /|\/ /|\ \/|\  /|\  /|\\\\|////|\  /|\  /|\/\/|\/\/|\  /|\  /|\/ /|\ \/|\  /|\  /|\\\\|////|\  /|\  /|\/\/|\/\/|\  /|\  /|\/ /|\ \/|
|\\/ | \/ | \/ | \/\|/\/ | \\\|/// | \/\|/\/ | \/\|/\/ | \//|\\/ | \/ | \/ | \/\|/\/ | \\\|/// | \/\|/\/ | \/\|/\/ | \//|\\/ | \/ | \/ |
|\\\ | /\/|\/\ | /\/|\/\ | /\\|//\ | /\ | /\ | /\/|\/\ | ///|\\\ | /\/|\/\ | /\/|\/\ | /\\|//\ | /\ | /\ | /\/|\/\ | ///|\\\ | /\/|\/\ |
|\\\\|/  \|/  \|/\/\|/\/\|/  \|/  \|/\ \|/ /\|/  \|/  \|////|\\\\|/  \|/  \|/\/\|/\/\|/  \|/  \|/\ \|/ /\|/  \|/  \|////|\\\\|/  \|/  \|
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
|////|\  /|\  /|\/\/|\/\/|\  /|\  /|\/ /|\ \/|\  /|\  /|\\\\|////|\  /|\  /|\/\/|\/\/|\  /|\  /|\/ /|\ \/|\  /|\  /|\\\\|////|\  /|\  /|
|/// | \/\|/\/ | \/\|/\/ | \//|\\/ | \/ | \/ | \/\|/\/ | \\\|/// | \/\|/\/ | \/\|/\/ | \//|\\/ | \/ | \/ | \/\|/\/ | \\\|/// | \/\|/\/ |
|//\ | /\ | /\ | /\/|\/\ | ///|\\\ | /\/|\/\ | /\/|\/\ | /\\|//\ | /\ | /\ | /\/|\/\ | ///|\\\ | /\/|\/\ | /\/|\/\ | /\\|//\ | /\ | /\ |
|/  \|/\ \|/ /\|/  \|/  \|////|\\\\|/  \|/  \|/\/\|/\/\|/  \|/  \|/\ \|/ /\|/  \|/  \|////|\\\\|/  \|/  \|/\/\|/\/\|/  \|/  \|/\ \|/ /\|
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
|\  /|\/ /|\ \/|\  /|\  /|\\\\|////|\  /|\  /|\/\/|\/\/|\  /|\  /|\/ /|\ \/|\  /|\  /|\\\\|////|\  /|\  /|\/\/|\/\/|\  /|\  /|\/ /|\ \/|
|\\/ | \/ | \/ | \/\|/\/ | \\\|/// | \/\|/\/ | \/\|/\/ | \//|\\/ | \/ | \/ | \/\|/\/ | \\\|/// | \/\|/\/ | \/\|/\/ | \//|\\/ | \/ | \/ |
|\\\ | /\/|\/\ | /\/|\/\ | /\\|//\ | /\ | /\ | /\/|\/\ | ///|\\\ | /\/|\/\ | /\/|\/\ | /\\|//\ | /\ | /\ | /\/|\/\ | ///|\\\ | /\/|\/\ |
|\\\\|/  \|/  \|/\/\|/\/\|/  \|/  \|/\ \|/ /\|/  \|/  \|////|\\\\|/  \|/  \|/\/\|/\/\|/  \|/  \|/\ \|/ /\|/  \|/  \|////|\\\\|/  \|/  \|
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
*/
#include <bits/stdc++.h>
#define fore(i, a, b) for (int i = (a), i##_last = (b); i < i##_last; ++i)
#define fort(i, a, b) for (int i = (a), i##_last = (b); i <= i##_last; ++i)
#define ford(i, a, b) for (int i = (a), i##_last = (b); i >= i##_last; --i)
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using ld = long double;

template<class A, class B> bool maxi(A &a, const B &b) {return (a < b) ? (a = b, true):false;};
template<class A, class B> bool mini(A &a, const B &b) {return (a > b) ? (a = b, true):false;};

typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;

const int maxN = 1005;

int n, ans, t[maxN], z[maxN], res[maxN];
vi p;
ll s;

int main() {
    #ifdef LOCAL
        freopen("input.INP", "r", stdin);
    #endif // LOCAL
    cin.tie(0) -> sync_with_stdio(0);
    cout.tie(0);
    cin >> n;
    fort(i, 1, n) {
        cin >> t[i] >> z[i];
        s += t[i];
        p.pb(i);
    }
    sort(all(p), [&](const int &x, const int &y) -> bool {
        return z[x] > z[y];
    });
    for (const int &i : p) {
        res[i] = min(s, (ll)z[i]);
        if (!res[i])
            ++ans;
        else
            s -= res[i];
    }
    cout << ans << '\n';
    fort(i, 1, n)
        cout << res[i] << ' ';
    cout << '\n';
    return 0;
}

Subtask #1

50.0 / 50.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	328 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	328 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct