QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#79995#2928. Espresso!perspectiveAC ✓2ms3712kbC++232.1kb2023-02-21 16:40:072023-02-21 16:40:08

Judging History

This is the latest submission verdict.

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-02-21 16:40:08]
  • Judged
  • Verdict: AC
  • Time: 2ms
  • Memory: 3712kb
  • [2023-02-21 16:40:07]
  • Submitted

answer

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>

using namespace std;

#define INP "input"
#define OUT "output"

/* some template */
template <typename T>
std::ostream& operator<<(std::ostream& out, const std::vector<T>& a) {
    out << (int)a.size() << '\n';
    for (const auto& v : a) out << v << ' ';
    out << endl;
    return out;
}

template <typename T>
std::ostream& operator<<(std::ostream& out, const std::vector<vector<T> >& a) {
    out << (int)a.size() << '\n';
    for (const auto& v : a) {
        for (const auto& value : v) out << value << ' ';
        out << endl;
    }
    return out;
}

template <typename T>
std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}
/* end template */

const long long INF_LL = 1e18;
const int INF = 1e9 + 100;
const long double EPS = 1e-6;
const int BLOCK = 550;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};

void open_file() {
#ifdef THEMIS
    freopen(INP ".txt", "r", stdin);
    freopen(OUT ".txt", "w", stdout);
#endif  // THEMIS
}

const int maxN = 1e6 + 100;
const int MOD = 1e9 + 7;

void sol() {
    int n, s;
    cin >> n >> s;
    int ans = 0;
    int remain = s;
    for (int i = 0; i < n; i++) {
        string t;
        cin >> t;
        int d = t[0] - '0';
        if (t.size() == 2) d++;
        if (remain >= d) remain -= d;
        else {
            ans++;
            remain = s - d;
        }
    }
    cout << ans;
}

void solve() {
    clock_t start, end;
    start = clock();
    int T = 1;
    // cin >> T;
    int TestCase = 0;
    while (T--) {
        TestCase += 1;
        cerr << "Processing test = " << TestCase << '\n';
        // cout << "Case #" << TestCase << ": ";
        sol();
        // if (T) cout << '\n';
    }
    end = clock();
    cerr << "Time = " << (double)(end - start) / (double)CLOCKS_PER_SEC << '\n';
}

int main(int argc, char* argv[]) {
    // srand(time(nullptr));
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    cout.tie(nullptr);
    open_file();
    solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3712kb

input:

1 10
4L

output:

0

result:

ok single line: '0'

Test #2:

score: 0
Accepted
time: 2ms
memory: 3608kb

input:

15 10
3
2L
3
1
3
2L
3
4
3L
2L
3
1
4
2
4L

output:

5

result:

ok single line: '5'

Test #3:

score: 0
Accepted
time: 2ms
memory: 3560kb

input:

8 24
1
1L
2
2L
3
3L
4
4L

output:

0

result:

ok single line: '0'

Test #4:

score: 0
Accepted
time: 2ms
memory: 3704kb

input:

8 24
1
3L
4
4L
2L
3
2
1L

output:

0

result:

ok single line: '0'

Test #5:

score: 0
Accepted
time: 2ms
memory: 3572kb

input:

100 10
3
3L
3
1
3
4
2
4L
2L
3L
3L
3
2L
1
3
4
3L
3L
2L
1
3L
2
3
3
3L
3
1
4
1L
4
2
4
3L
3
1L
2
1L
4
4
3L
4
3L
1L
1L
1
3
2
1L
3
1L
3
4L
4L
3L
4
1L
2L
2
4
1
2
1
4L
3L
1L
2L
3
2L
1L
2L
2L
3
2L
2
3L
3L
4L
1
2L
3L
4
3
3L
4L
4
3
4L
1
2
2
3L
2
1L
4
3L
4
1
3L
4
1L

output:

34

result:

ok single line: '34'

Test #6:

score: 0
Accepted
time: 2ms
memory: 3660kb

input:

100 11
3L
3L
3
2
3L
1L
2
3L
2
3
3
4
1
3
1L
2L
2L
4
2L
4L
2L
4
3
4L
4
2L
2
4L
3L
2L
3
1L
4L
2L
2L
1
2L
1
1
1L
1L
1L
2
1L
2
2
3L
1L
1
4L
4
3L
2L
4
4L
4
4
2L
3
2L
1
2L
2L
2L
2L
4L
4
3
4L
1L
2
4
1L
2L
4
2
1
2
3
4
2L
1
3L
1L
3
3L
1L
2
4
1L
3L
1
4L
4L
3L
2
1L
3L
2L
2L

output:

31

result:

ok single line: '31'

Test #7:

score: 0
Accepted
time: 0ms
memory: 3572kb

input:

100 12
1
2
1L
4
3L
3
2L
4L
1L
3
4L
3L
1
1L
4
2L
3L
4L
4
3L
1L
4
1L
4L
3L
1L
2
4
1
2
3
2L
4
2L
2
2L
4
2
4
3
4
2L
4L
2
1
4L
2L
2
3
2
1L
2L
4
3
2
1
2
4
1L
1L
4L
1L
1
1L
1
2
1L
4L
1
3
1L
3L
4
4L
1
1
4L
1L
2L
2L
2L
2L
1
2
1L
3
2L
4L
4
3
1L
1
4
4
4
3L
4
4
1L
1L

output:

27

result:

ok single line: '27'

Test #8:

score: 0
Accepted
time: 2ms
memory: 3620kb

input:

100 13
1L
2L
2
2
4L
2
4
3L
2L
4L
4L
2
1
3
4
3
1
2L
2L
4
4
3
2
3L
3
4L
3L
1
4
2
4
2
4L
4L
2
2L
2L
2L
4L
2L
4L
1
4
2L
3
1L
1L
4L
4
4L
3
1L
1L
2
4
4L
2L
1
1
3
1L
4L
1
2L
2
1L
2L
2L
1
2
2L
3L
3L
2L
3
3
4L
4
4L
4L
3
4L
4
3
1L
3
4
2L
4L
2
2
3L
3L
3
4L
4L
3L
1
2L
3L

output:

27

result:

ok single line: '27'

Test #9:

score: 0
Accepted
time: 2ms
memory: 3576kb

input:

100 15
1
4
3
2
4L
3L
1L
4
3L
3L
2
2L
1L
4L
3L
4L
1
2
3
2
2L
2
4
2
4L
1L
3
2
1L
1
2L
3
2L
1L
4
1
2L
1L
3L
4L
3L
1L
2L
3L
2L
4L
1L
1L
1L
1L
3
1L
4
3L
3
1
2
3L
4
4L
1
3
1L
4
1L
2L
1L
4
4L
4L
3L
1L
2
2
4L
1L
3L
4
1L
2
1L
3L
3
4L
2L
1
4L
2
4L
3L
4
1
4
4
4
3L
4
3L
2L
3

output:

22

result:

ok single line: '22'

Test #10:

score: 0
Accepted
time: 0ms
memory: 3700kb

input:

100 17
2
3L
1L
1L
3
2L
4
3
1L
2
3L
3
3L
2L
1
2L
3L
3
2
1L
4L
1L
3
3
4
1
2L
3L
1
2
1L
4
3
3L
3L
1L
4
2
4
2
3L
3L
1
1L
3L
4
3
2L
1L
2
2
1L
2L
1
3L
3
4
4
2L
1
2L
1
3
4L
2
4L
4L
2L
3
3
4L
4L
3L
4L
1
4L
3L
1L
3L
2
4L
1L
1L
2L
3L
2L
3L
1
2L
3
2
4L
4
1
3L
1L
4
4
2
3L

output:

19

result:

ok single line: '19'

Test #11:

score: 0
Accepted
time: 2ms
memory: 3512kb

input:

100 24
1
3
2
4
1
4
2
1L
1L
4
2
1
3L
2L
3
2L
1
1
1
1L
3
1L
2L
3L
1L
4
4
2
3
3L
1
3L
2
2
2L
4L
4L
4L
2L
1L
4
3L
4L
3
4
4L
2
3
2
4L
2L
3L
1
3L
4
1L
1L
3L
4L
4L
2
1
2
4
3
3
3L
2L
2L
4
1
4L
2L
4L
3L
4
4
1L
4L
1
1
2
4L
2
1L
4L
3L
3
4
4
4L
3
2L
2L
3
2L
1L
3
3
1

output:

13

result:

ok single line: '13'

Test #12:

score: 0
Accepted
time: 2ms
memory: 3612kb

input:

100 131
1
1L
2
2L
1
4L
3L
3L
3L
4
2
3
3
1L
3
3
1
3L
3L
4L
2
3
2
1L
2
4
4L
4L
3
3
4L
3
2
3
2L
4L
4L
4
3L
4L
2
3L
2
3
4
1L
1
2
2L
3L
4L
3
3L
3L
1
1L
3L
3
4
3L
2
1
4L
2
3L
1
1
2
4
1
1
4L
4L
2L
3L
3
3
4L
3L
4L
4
4L
1
3
1
4L
4
3
4L
3L
4L
2
4
4
4L
1L
1L
4
3L
2

output:

2

result:

ok single line: '2'

Test #13:

score: 0
Accepted
time: 2ms
memory: 3708kb

input:

100 200
2
2
2L
1
1L
3L
1L
1L
1
3L
2L
3L
3
1
2L
2L
2L
4
1L
3L
1L
2
3L
3
2
3
4
2L
2
2L
1
3L
3
2L
3L
3
4L
4
1
1L
4L
1L
2L
1
2L
4L
1
3
4L
4L
1L
2
4
2
4L
3L
3L
2L
3
3
3L
3L
4L
4
3
3L
4L
3L
1L
4
1
4L
1
1
4L
2L
2
2
4L
1L
1
3L
4L
3
2L
2L
4
2L
3L
4L
4
2
4L
1
1L
4L
4L
1
1L
1

output:

1

result:

ok single line: '1'

Test #14:

score: 0
Accepted
time: 2ms
memory: 3568kb

input:

8 10
1
2L
3
4
3L
1
1L
4L

output:

2

result:

ok single line: '2'

Test #15:

score: 0
Accepted
time: 0ms
memory: 3584kb

input:

3 12
4
4
4

output:

0

result:

ok single line: '0'