oj.uz

Submission #908246

# Submission time Handle Problem Language Result Execution time Memory
908246 2024-01-16T10:16:48 Z nightfal Simurgh (IOI17_simurgh) C++14
0 / 100
 3000 ms 348 KB 
#include <cstdio>
#include <iostream>
#include <cassert>
#include <vector>
#include <cstdlib>
#include <string>

using namespace std;

static int MAXQ = 30000;

static int n, m, q = 0;
static vector<int> u, v;
static vector<bool> goal;

std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v);
int count_common_roads(const std::vector<int>& r);

bool isSubtask1(int n) {return n<=7;}
bool isSubtask2(int n) {return n<=50;}
bool isSubtask3(int n) {return n<=240;}

bool hasBackEdge(int parent, int now, std::vector<int>& visit, std::vector<vector<int>>& edgeL) {
    for(int elem: edgeL[now]) {
        if (elem==parent) continue;
        if (visit[elem] || hasBackEdge(now,elem,visit,edgeL)) {printf("Edge: %d -> %d\n",now,elem); return true;}
    }
    return false;
}

bool isTree(std::vector<int>& edges, std::vector<int>& u, std::vector<int>& v) {
    n = edges.size()+1;
    std::vector<vector<int>> edgeL(n);
    std::vector<int> connect(n,0);
    for(int i=0; i<n-1; i++) {
        int idx = edges[i];
        edgeL[u[idx]].push_back(v[idx]);
        edgeL[v[idx]].push_back(u[idx]);
        connect[u[idx]] = connect[v[idx]] = 1;
    }

    // cout << "edge numbers: "; for(int elem: edges) cout << elem << " "; cout << endl;
    // if (edges[0] >=3) {
    //     cout << "edge List\n";
    //     for(int i=0; i<n; i++) {
    //         printf("%d: ", i);
    //         for(int elem: edgeL[i]) printf("%d ",elem); cout << endl;
    //     }
    // }
    for(int elem: connect) if(elem==0) {/* cout << "not connected\n";*/ return false;}
    
    vector<int> visit(n,0); visit[0] = 1; 
    int parent = 0, now = 0;
    if (hasBackEdge(parent,now,visit,edgeL)) return false;
    else {/* cout<< "isTree\n";*/ return true;}
}
bool selectEdges(int cnt, int start, int n, int m, std::vector<int>& edges, std::vector<int>& u, std::vector<int>& v){
    if (cnt == n-1 && isTree(edges,u,v) && count_common_roads(edges)==n-1) return true;
    for(int i=start; i<m; i++){
        edges[cnt] = i;
        if (selectEdges(cnt+1,i+1,n,m,edges,u,v)) return true;
    }
    return false;
}
std::vector<int> subtask1(int n, std::vector<int>& u, std::vector<int>& v) {
    int m = u.size();
    std::vector<int> r(n-1), zero(n-1,-1);
    if (selectEdges(0,0,n,m,r,u,v)) return r;
    else return zero;
}

std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
    // if (isSubtask1(n)) 
    return subtask1(n,u,v);

	std::vector<int> r(n - 1);
	for(int i = 0; i < n - 1; i++)
		r[i] = i;
	int common = count_common_roads(r);
	if(common == n - 1)
		return r;
	r[0] = n - 1;
	return r;
}

Compilation message

simurgh.cpp:12:18: warning: 'q' defined but not used [-Wunused-variable]
   12 | static int n, m, q = 0;
      |                  ^
simurgh.cpp:12:15: warning: 'm' defined but not used [-Wunused-variable]
   12 | static int n, m, q = 0;
      |               ^
simurgh.cpp:10:12: warning: 'MAXQ' defined but not used [-Wunused-variable]
   10 | static int MAXQ = 30000;
      |            ^~~~

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB correct
2 Execution timed out 3040 ms 348 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -