oj.uz

Submission #784020

# Submission time Handle Problem Language Result Execution time Memory
784020 2023-07-15T14:44:11 Z GrindMachine Izlet (COI19_izlet) C++17
25 / 100
 471 ms 35852 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 = 3000 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<pii> adj[N];
vector<int> ans(N);
vector<pii> edges;
vector<bool> vis(N);

void dfs(int u){
    vis[u] = 1;
    for(auto [v,w] : adj[u]){
        if(vis[v]) conts;
        edges.pb({u,v});
        if(w == 0) ans[v] = ans[u];
        else ans[v] = 3^ans[u];
        dfs(v);
    }
}

void solve(int test_case)
{
    int s; cin >> s;
    int n; cin >> n;
    int a[n+5][n+5];
    rep1(i,n) rep1(j,n) cin >> a[i][j];
    
    if(s == 1){
        rep1(i,n){
            for(int j = i+1; j <= n; ++j){
                if(a[i][j] == 1){
                    adj[i].pb({j,0});
                    adj[j].pb({i,0});
                }
                else{
                    adj[i].pb({j,1});
                    adj[j].pb({i,1});
                }
            }
        }

        rep1(i,n){
            if(!vis[i]){
                ans[i] = 1;
                dfs(i);
            }
        }

        rep1(i,n) cout << ans[i] << " ";
        cout << endl;

        for(auto [u,v] : edges){
            cout << u << " " << v << endl;
        }

        return;
    }

    vector<int> active(n+5);
    vector<int> nxt(n+5,-1);

    rep1(i,n){
        int expect = 1;
        rev(j,i-1,1){
            expect += active[j];
            if(a[i][j] != expect){
                nxt[j] = i;
                active[j] = 0;
                break;
            }
        }
        active[i] = 1;
    }

    vector<bool> vis(n+5);
    int ptr = 1;

    rep1(i,n){
        if(vis[i]) conts;
        int j = i;
        while(j != -1){
            vis[j] = 1;
            ans[j] = ptr;
            j = nxt[j];
        }
        ptr++;
    }

    rep1(i,n) cout << ans[i] << " ";
    cout << endl;

    rep1(i,n-1) cout << i << " " << i+1 << endl;
}

int main()
{
    fastio;

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

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

    return 0;
}

Subtask #1
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 336 ms 35852 KB Output is correct
2 Correct 335 ms 35720 KB Output is correct
3 Correct 431 ms 35724 KB Output is correct
4 Correct 471 ms 35728 KB Output is correct
5 Correct 326 ms 35788 KB Output is correct
6 Correct 365 ms 35668 KB Output is correct
7 Correct 262 ms 25608 KB Output is correct

Subtask #3
0 / 57.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -