oj.uz

Submission #253931

# Submission time Handle Problem Language Result Execution time Memory
253931 2020-07-29T06:13:55 Z Vimmer Esej (COCI15_esej) C++14
80 / 80
 50 ms 1912 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 pf push_front
#define N 50050
#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 unsigned long long ull;
typedef short int si;
typedef array <ll, 3> a3;
typedef array <ll, 5> a5;

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

int a, b, kol;

vector <char> gr;

void dfs()
{
    if (sz(gr) == 15) return;

    for (int i = 0; i < 26; i++)
    {
        char c = char('a' + i);

        gr.pb(c);

        for (auto it : gr) cout << it; kol++;

        if (kol == b) exit(0);

        cout << " ";

        gr.pop_back();
    }

    for (int i = 0; i < 26; i++)
    {
        char c = char('a' + i);

        gr.pb(c);

        dfs();

        gr.pop_back();
    }
}

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);

    cin >> a >> b;

    b /= 2;

    b = max(b, a);

    dfs();
}

Compilation message

esej.cpp: In function 'void dfs()':
esej.cpp:46:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
         for (auto it : gr) cout << it; kol++;
         ^~~
esej.cpp:46:40: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
         for (auto it : gr) cout << it; kol++;
                                        ^~~

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 24 ms 1152 KB Output is correct
8 Correct 38 ms 1664 KB Output is correct
9 Correct 50 ms 1912 KB Output is correct
10 Correct 31 ms 1152 KB Output is correct