oj.uz

Submission #747380

# Submission time Handle Problem Language Result Execution time Memory
747380 2023-05-24T06:24:20 Z onebit1024 Izlet (COI19_izlet) C++17
25 / 100
 582 ms 109496 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pb push_back
#define all(c) c.begin(), c.end()
#define endl "\n"

const double PI=3.141592653589;


void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define dbg(x...) cerr << "LINE(" << __LINE__ << ") -> " <<"[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif



void solve()
{
    int k;cin>>k;
    int n;
    cin >> n;
    vector<vector<int>>a(n+1, vector<int>(n+1));
    for(int i = 1;i<=n;++i){
        for(int j = 1;j<=n;++j)cin  >> a[i][j];
    }
    vector<int>res(n+1,-1);
    int ptr = 1;
    res[1] = ptr++;
    for(int i = 2;i<=n;++i){
        for(int j = i-1;j>=1;--j){
            if(a[j][i]!=(a[j][i-1]+1)){
                res[i] = res[j];
                break;
            }
        }
        if(res[i]==-1)res[i] = ptr++;
    }
    for(int i = 1;i<=n;++i)cout << res[i] << ' ';
    cout << endl;
    for(int i = 1;i<n;++i)cout << i << ' ' << i+1 << endl;
}   

int32_t main()
{

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);


    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    

    int T=1;
    for(int i = 1;i<=T;++i)
    {
        // cout << "Case #" << i << ": ";
        solve();
    }
}

Subtask #1
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 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 449 ms 70908 KB Output is correct
2 Correct 417 ms 88604 KB Output is correct
3 Correct 550 ms 108696 KB Output is correct
4 Correct 582 ms 109496 KB Output is correct
5 Correct 401 ms 88524 KB Output is correct
6 Correct 478 ms 95512 KB Output is correct
7 Correct 332 ms 69536 KB Output is correct

Subtask #3
0 / 57.0

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