oj.uz

답안 #738945

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
738945 2023-05-09T16:56:23 Z GrindMachine Rima (COCI17_rima) C++17
14 / 140
 1000 ms 22512 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n; cin >> n;
    vector<string> a(n);
    rep(i, n) cin >> a[i];

    auto cmp = [&](string & s1, string & s2) {
        return sz(s1) < sz(s2);
    };

    sort(all(a), cmp);

    auto ok = [&](string big, string small) {
        ll ptr = sz(big) - 1;
        ll len = 0;

        rev(i, sz(small) - 1, 0) {
            if (small[i] == big[ptr]) {
                len++;
                ptr--;
            }
            else {
                break;
            }
        }

        return len >= max(sz(big), sz(small)) - 1;
    };

    vector<ll> dp(n);

    rep(i, n) {
        dp[i] = 1;
        rep(j, i) {
            if (ok(a[i], a[j])) {
                amax(dp[i], dp[j] + 1);
            }
        }
    }

    ll ans = *max_element(all(dp));
    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

rima.cpp: In lambda function:
rima.cpp:88:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'long unsigned int' [-Wsign-compare]
   88 |         return len >= max(sz(big), sz(small)) - 1;
      |                ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 316 KB Output isn't correct
4 Execution timed out 1073 ms 22512 KB Time limit exceeded
5 Execution timed out 1049 ms 6360 KB Time limit exceeded
6 Incorrect 282 ms 1932 KB Output isn't correct
7 Incorrect 154 ms 1680 KB Output isn't correct
8 Incorrect 108 ms 1508 KB Output isn't correct
9 Execution timed out 1066 ms 7052 KB Time limit exceeded
10 Incorrect 81 ms 1604 KB Output isn't correct