Submission #1337760

#	Time	Username	Problem	Language	Result	Execution time	Memory
1337760		nguyengiabach1201	BOI Acronym (BOI25_boi)	C++20	0 / 100	1 ms	836 KiB

Main

// https://oj.uz/problem/view/BOI25_boi

#include <bits/stdc++.h>

using namespace std;

#define el '\n'
#define FNAME ""
#define ll long long
#define int long long
#define ld long double

const int MOD = 1e9 + 7;
const ll INF = 1e18 + 7;
const double EPS = 1e-9;

void setup()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    if (fopen(FNAME ".inp", "r"))
    {
        freopen(FNAME ".inp", "r", stdin);
        freopen(FNAME ".out", "w", stdout);
    }

    return;
}

const int N = 2e3 + 5;
int n, m[N][N];

void solve()
{
    cin >> n;

    for (int i = 1; i <= n; ++i)
        for (int j = i; j <= n; ++j)
            cin >> m[i][j];

    vector<int> p(n + 5);

    for (int i = 1; i <= n; ++i)
    {
        p[i] = p[i - 1] + 1;

        for (int j = 1; j <= i; ++j)
            p[i] = min(p[i], m[j][i] + p[j - 1]);
    }

    vector<int> ans;

    for (int i = 1; i <= n; ++i)
        if (p[i] != p[i - 1])
            ans.push_back(i);

    // sort(ans.begin(), ans.end());

    for (int i : ans)
        cout << i << " ";
    cout << el;

    return;
}

signed main()
{
    setup();

    int t = 1;
    bool multiTest = false;

    if (multiTest)
        cin >> t;

    while (t--)
        solve();

    return 0;
}

Compilation message (stderr)

Main.cpp: In function 'void setup()':
Main.cpp:24:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |         freopen(FNAME ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:25:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |         freopen(FNAME ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 0
• Subtask 2: 0 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 10
• Subtask 5: 0 / 11
• Subtask 6: 0 / 19
• Subtask 7: 0 / 37