제출 #234258

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
234258		VEGAnn	Izlet (COI19_izlet)	C++14	25 / 100	728 ms	50528 KiB

izlet

#include <bits/stdc++.h>
#define PB push_back
#define a2 array<int,2>
using namespace std;
const int N = 3010;
const int M = 1010;
const int oo = 2e9;
int ans[N], a[N][N], n, kol = 1;
bool mrk[N];

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> n;

    assert(n == 2);

    cin >> n;

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

    ans[0] = 1;

    for (int i = 1; i < n; i++){
        bool ok = 0;

        fill(mrk, mrk + n, 0);
        int cnt = 0;

        for (int j = i - 1; j >= 0; j--) {
            if (!mrk[ans[j]])
                cnt++;
            mrk[ans[j]] = 1;

            if (a[i][j] == cnt){
                ok = 1;
                ans[i] = ans[j];
                break;
            }
        }

        if (!ok)
            ans[i] = ++kol;
    }

    for (int i = 0; i < n; i++){
        int cnt = 0;
        fill(mrk + 1, mrk + n + 1, 0);

        for (int j = i; j < n; j++){
            if (!mrk[ans[j]])
                cnt++;

            mrk[ans[j]] = 1;

            assert(cnt == a[i][j] && cnt == a[j][i]);
        }
    }

    for (int i = 0; i < n; i++)
        cout << ans[i] << " ";

    cout << '\n';

    for (int i = 1; i < n; i++)
        cout << i << " " << i + 1 << '\n';

    return 0;
}

• Subtask 1: 0 / 18
• Subtask 2: 25 / 25
• Subtask 3: 0 / 57