oj.uz

답안 #144115

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
144115 2019-08-16T06:31:23 Z LeMur Izlet (COI19_izlet) C++14
18 / 100
 863 ms 72256 KB 
////////////////////////////////////////////    _LeMur_
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#include <unordered_map>
#include <unordered_set>
#include <functional>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cassert>
#include <chrono>
#include <random>
#include <bitset>
#include <cstdio>
#include <vector>
#include <string>
#include <ctime>
#include <stack>
#include <queue>
#include <cmath>
#include <list>
#include <map>
#include <set>

using namespace std;

const int N = 3005;
const int inf = 1000 * 1000 * 1000;
const int mod = 1000 * 1000 * 1000 + 7;

int t;
int n;
int a[N][N];

vector <int> g[N];
int answ[N];

vector < pair<int,int> > edge;

int main(){
	mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
    cin >> t;
    cin >> n;
    int s = 0 , id;
    for(int i=1;i<=n;i++){
        int mx = 0;
        for(int j=1;j<=n;j++){
            scanf("%d",&a[i][j]);
            mx = max(mx , a[i][j]);
        }
        if(mx > s){
            s = mx;
            id = i;
        }
    }
    for(int i=1;i<=n;i++){
        g[ a[id][i] ].push_back(i);
        answ[i] = a[id][i];
    }
    for(int i=1;i<=s;i++){
        for(int h=0;h<(int)g[i].size();h++){
            if(i == 1 && h == 0)continue;
            int v = g[i][h];
            bool flag = false;
            for(int j=0;j<h;j++){
                int p = g[i][j];
                if(a[v][p] == 1){
                    edge.push_back(make_pair(v , p));
                    flag = true;
                    break;
                }
            }
            if(!flag && i > 1){
                for(int j=0;j<(int)g[i - 1].size();j++){
                    int p = g[i - 1][j];
                    if(a[v][p] == 2){
                        edge.push_back(make_pair(v , p));
                        flag = true;
                        break;
                    }
                }
            }
            assert(flag == true);
        }
    }
    for(int i=1;i<=n;i++){
        cout << answ[i] << " ";
    }
    cout << endl;
    assert( (int)edge.size() == n - 1 );
    for(int i=0;i<n-1;i++){
        cout << edge[i].first << " " << edge[i].second << endl;
    }
    return 0;
}

Compilation message

izlet.cpp: In function 'int main()':
izlet.cpp:49:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d",&a[i][j]);
             ~~~~~^~~~~~~~~~~~~~~
izlet.cpp:59:26: warning: 'id' may be used uninitialized in this function [-Wmaybe-uninitialized]
         answ[i] = a[id][i];
                   ~~~~~~~^

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 835 ms 53416 KB Output is correct
3 Correct 838 ms 53496 KB Output is correct
4 Correct 832 ms 53428 KB Output is correct
5 Correct 831 ms 53208 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 863 ms 72256 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 835 ms 53416 KB Output is correct
3 Correct 838 ms 53496 KB Output is correct
4 Correct 832 ms 53428 KB Output is correct
5 Correct 831 ms 53208 KB Output is correct
6 Runtime error 863 ms 72256 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Halted 0 ms 0 KB -