Submission #593227

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
593227	2022-07-10T15:35:02 Z	nguyen31hoang08minh2003	Imena (COCI16_imena)	C++14	50 / 50	1 ms	328 KB

imena

/*
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
|////|  (/|\)  |\/\/|\/\/|  (/|\)  |\/ /|\ \/|  (/|\)  |\\\\|////|  (/|\)  |\/\/|\/\/|  (/|\)  |\/ /|\ \/|  (/|\)  |\\\\|////|  (/|\)  |
|/// |  /\|/\  | \/\|/\/ |  //|\\  | \/ | \/ |  /\|/\  | \\\|/// |  /\|/\  | \/\|/\/ |  //|\\  | \/ | \/ |  /\|/\  | \\\|/// |  /\|/\  |
|//  | /\ | /\ |  \/|\/  | ///|\\\ |  \/|\/  | /\/|\/\ |  \\|//  | /\ | /\ |  \/|\/  | ///|\\\ |  \/|\/  | /\/|\/\ |  \\|//  | /\ | /\ |
|/)  |/\ \|/ /\|  (\|/)  |////|\\\\|  (\|/)  |/\/\|/\/\|  (\|/)  |/\ \|/ /\|  (\|/)  |////|\\\\|  (\|/)  |/\/\|/\/\|  (\|/)  |/\ \|/ /\|
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
|\)  |\/ /|\ \/|  (/|\)  |\\\\|////|  (/|\)  |\/\/|\/\/|  (/|\)  |\/ /|\ \/|  (/|\)  |\\\\|////|  (/|\)  |\/\/|\/\/|  (/|\)  |\/ /|\ \/|
|\\  | \/ | \/ |  /\|/\  | \\\|/// |  /\|/\  | \/\|/\/ |  //|\\  | \/ | \/ |  /\|/\  | \\\|/// |  /\|/\  | \/\|/\/ |  //|\\  | \/ | \/ |
|\\\ |  \/|\/  | /\/|\/\ |  \\|//  | /\ | /\ |  \/|\/  | ///|\\\ |  \/|\/  | /\/|\/\ |  \\|//  | /\ | /\ |  \/|\/  | ///|\\\ |  \/|\/  |
|\\\\|  (\|/)  |/\/\|/\/\|  (\|/)  |/\ \|/ /\|  (\|/)  |////|\\\\|  (\|/)  |/\/\|/\/\|  (\|/)  |/\ \|/ /\|  (\|/)  |////|\\\\|  (\|/)  |
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
|////|  (/|\)  |\/\/|\/\/|  (/|\)  |\/ /|\ \/|  (/|\)  |\\\\|////|  (/|\)  |\/\/|\/\/|  (/|\)  |\/ /|\ \/|  (/|\)  |\\\\|////|  (/|\)  |
|/// |  /\|/\  | \/\|/\/ |  //|\\  | \/ | \/ |  /\|/\  | \\\|/// |  /\|/\  | \/\|/\/ |  //|\\  | \/ | \/ |  /\|/\  | \\\|/// |  /\|/\  |
|//  | /\ | /\ |  \/|\/  | ///|\\\ |  \/|\/  | /\/|\/\ |  \\|//  | /\ | /\ |  \/|\/  | ///|\\\ |  \/|\/  | /\/|\/\ |  \\|//  | /\ | /\ |
|/)  |/\ \|/ /\|  (\|/)  |////|\\\\|  (\|/)  |/\/\|/\/\|  (\|/)  |/\ \|/ /\|  (\|/)  |////|\\\\|  (\|/)  |/\/\|/\/\|  (\|/)  |/\ \|/ /\|
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
|\)  |\/ /|\ \/|  (/|\)  |\\\\|////|  (/|\)  |\/\/|\/\/|  (/|\)  |\/ /|\ \/|  (/|\)  |\\\\|////|  (/|\)  |\/\/|\/\/|  (/|\)  |\/ /|\ \/|
|\\  | \/ | \/ |  /\|/\  | \\\|/// |  /\|/\  | \/\|/\/ |  //|\\  | \/ | \/ |  /\|/\  | \\\|/// |  /\|/\  | \/\|/\/ |  //|\\  | \/ | \/ |
|\\\ |  \/|\/  | /\/|\/\ |  \\|//  | /\ | /\ |  \/|\/  | ///|\\\ |  \/|\/  | /\/|\/\ |  \\|//  | /\ | /\ |  \/|\/  | ///|\\\ |  \/|\/  |
|\\\\|  (\|/)  |/\/\|/\/\|  (\|/)  |/\ \|/ /\|  (\|/)  |////|\\\\|  (\|/)  |/\/\|/\/\|  (\|/)  |/\ \|/ /\|  (\|/)  |////|\\\\|  (\|/)  |
+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+----+
*/
#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 string marks = ".?!";

int n, res;
string word;

bool checkCapitalize(const string &word) {
    if (word.empty() || !isupper(word.front()))
        return false;
    fore(i, 1, sz(word))
        if (!islower(word[i]))
            return false;
    return true;
}

bool checkMark(const char &c) {
    for (const char &mark : marks)
        if (c == mark)
            return true;
    return false;
}

int main() {
    bool flag;
    #ifdef LOCAL
        freopen("input.INP", "r", stdin);
    #endif // LOCAL
    cin.tie(0) -> sync_with_stdio(0);
    cout.tie(0);
    while (cin >> word) {
        flag = checkMark(word.back());
        if (flag)
            word.pop_back();
        if (checkCapitalize(word))
            ++res;
        if (flag) {
            cout << res << '\n';
            res = 0;
        }
    }
    return 0;
}

Subtask #1

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	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	0 ms	328 KB	Output is correct
8	Correct	0 ms	328 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct