oj.uz

Submission #888211

# Submission time Handle Problem Language Result Execution time Memory
888211 2023-12-16T13:05:52 Z 12345678 Connecting Supertrees (IOI20_supertrees) C++17
0 / 100
 1 ms 436 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=1e3+5;
bool vs[nx];

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer(n, vector<int> (n, 0));
	for (int i=0; i<n; i++)
    {
        if (vs[i]) continue;
        queue<int> q;
        vector<int> d;
        q.push(i); vs[i]=1;
        while (!q.empty())
        {
            auto u=q.front(); 
            q.pop();
            d.push_back(u);
            for (int v=0; v<n; v++) if (p[u][v]==2&&!vs[v]) vs[v]=1, q.push(v);
        }
        for (auto u:d) for (auto v:d) if (p[u][v]==0) return 0;
        if (d.size()<=1) continue;
        for (int j=0; j<d.size()-1; j++) answer[d[j]][d[j+1]]=answer[d[j+1]][d[j]]=1;
        answer[d[0]][d[d.size()-1]]=answer[d[d[d.size()-1]]][d[0]]=1;
    }
	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:27:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |         for (int j=0; j<d.size()-1; j++) answer[d[j]][d[j+1]]=answer[d[j+1]][d[j]]=1;
      |                       ~^~~~~~~~~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 436 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 436 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 432 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Incorrect 1 ms 344 KB Too few ways to get from 1 to 2, should be 1 found 0
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 436 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 436 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -