oj.uz

Submission #238015

# Submission time Handle Problem Language Result Execution time Memory
238015 2020-06-09T17:50:23 Z Vimmer Retro (COCI17_retro) C++14
0 / 100
 132 ms 214028 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 100001
#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;


ll f[301][301][301], n, m;

string s[301];

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 >> n >> m;

    for (int i = 0; i < n; i++) cin >> s[i];

    int sx, sy;

    for (int i = 0; i < m; i++)
        if (s[n - 1][i] == 'M') {sx = n - 1; sy = i; break;}

    memset(f, -1, sizeof(f));

    f[sx][sy][0] = 0;

    ll I = -1, J, K = -1;

    for (int i = n - 1; i > 0; i--)
        for (int j = 0; j < m; j++)
          for (int st = 0; st <= n - i - 1; st++)
            {
                if (f[i][j][st] == -1 || s[i][j] == '*') continue;

                for (int a = -1; a <= 1; a++)
                    if (a + j >= 0 && a + j < m && (st != 0 || s[i - 1][j + a] != ')'))
                    {
                        ll nw = f[i][j][st] + 1, nk = st;

                        if (s[i - 1][j + a] == '(') nk++; else nk--;

                        if (f[i - 1][j + a][nk] == -1 || f[i - 1][j + a][nk] < nw) f[i - 1][j + a][nk] = nw;
                    }
            }

    for (int i = 0; i < 301; i++)
        for (int j = 0; j < 301; j++)
            if (K < f[i][j][0]) {I = i; J = j; K = f[i][j][0];}

    if (I == -1) cout << 0 << endl;
     else
     {
        cout << K << endl;

        for (int i = 0; i < K; i++) cout << ')';
     }
}

Compilation message

retro.cpp: In function 'int main()':
retro.cpp:53:16: warning: variable 'J' set but not used [-Wunused-but-set-variable]
     ll I = -1, J, K = -1;
                ^
retro.cpp:51:18: warning: 'sx' may be used uninitialized in this function [-Wmaybe-uninitialized]
     f[sx][sy][0] = 0;
     ~~~~~~~~~~~~~^~~
retro.cpp:51:18: warning: 'sy' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 107 ms 213752 KB Integer 0 violates the range [1, 100000]
2 Incorrect 103 ms 213752 KB Output isn't correct
3 Incorrect 110 ms 213752 KB Output isn't correct
4 Incorrect 106 ms 213752 KB Integer 0 violates the range [1, 100000]
5 Incorrect 109 ms 213880 KB Output isn't correct
6 Incorrect 107 ms 213776 KB Integer 0 violates the range [1, 100000]
7 Incorrect 109 ms 213880 KB Integer 0 violates the range [1, 100000]
8 Incorrect 109 ms 213752 KB Integer 0 violates the range [1, 100000]
9 Incorrect 108 ms 213752 KB Integer 0 violates the range [1, 100000]
10 Incorrect 109 ms 213884 KB Integer 0 violates the range [1, 100000]
11 Incorrect 121 ms 213880 KB Integer 0 violates the range [1, 100000]
12 Incorrect 123 ms 214028 KB Output isn't correct
13 Incorrect 115 ms 213880 KB Output isn't correct
14 Incorrect 114 ms 213880 KB Integer 0 violates the range [1, 100000]
15 Incorrect 126 ms 213880 KB Integer 0 violates the range [1, 100000]
16 Incorrect 126 ms 214012 KB Integer 0 violates the range [1, 100000]
17 Incorrect 122 ms 213880 KB Integer 0 violates the range [1, 100000]
18 Incorrect 128 ms 213884 KB Integer 0 violates the range [1, 100000]
19 Incorrect 132 ms 213880 KB Output isn't correct
20 Incorrect 125 ms 213880 KB Integer 0 violates the range [1, 100000]