oj.uz

Submission #243639

# Submission time Handle Problem Language Result Execution time Memory
243639 2020-07-01T13:00:36 Z Vimmer Imena (COCI16_imena) C++14
50 / 50
 5 ms 384 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 1000001
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 2> a2;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


bool good(char x) {return (0 <= x - 'a' &&  x - 'a' < 26); }
bool gdr(char x) {return (0 <= x - 'A' &&  x - 'A' < 26); }
bool bad(char x) {return (x == '!' || x == '.' || x == '?'); }

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    string s = "";

    string str;

    while (cin >> str)
    {
        if (s != "") s += ' ';

        s += str;
    }

    int i = 0;

    for (int j = 0; j < n; j++)
    {
        int kol = 0;

        while (!bad(s[i]))
        {
            if (s[i] == ' ') {i++; continue;}

            if (good(s[i])) {while (!bad(s[i]) && s[i] != ' ') i++; continue;}

            if (gdr(s[i]))
                {
                    bool gd = 1;

                    i++;

                    while (!bad(s[i]) && s[i] != ' ') {if (!good(s[i])) gd = 0; i++;}

                    if (gd) kol++;

                    continue;
            }

            while (!bad(s[i]) && s[i] != ' ') i++;

        }

        cout << kol << endl;

        i++;
    }
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct