oj.uz

Submission #526527

# Submission time Handle Problem Language Result Execution time Memory
526527 2022-02-15T06:14:56 Z beksultan04 Fun Tour (APIO20_fun) C++14
0 / 100
 2000 ms 2292 KB 
#include "fun.h"
//#include "grader.cpp"
#include <bits/stdc++.h>

#define ret return
#define fr first
#define sc second
#define pb push_back
#define endi puts("");
#define NO puts("NO");
#define OK puts("OK");

using namespace std;
const int INF = 1e5+12;
bool asa,ll=0;
int dis[1001][1001],n,used[1001];
vector <int> ans;
void dfs(int x,int dl){
    if (ll == 1)ret ;
    if (ans.size() == n){
        ll = 1;
        ret ;
    }
    for (int i=0;i<n;++i){
        if (x == i || used[i])continue;
        if (!dis[x][i]){
            dis[x][i] = hoursRequired(x,i);
            dis[i][x] = dis[x][i];
        }
        if (dl >= dis[x][i]){
            used[i] = 1;
            ans.pb(i);
            dfs(i,dis[x][i]);
            if (ll == 1)ret ;
            ans.pop_back();
            used[i] = 0;
        }
    }
}

vector<int> createFunTour(int N, int Q) {
    n = N;
    dfs(0,INF);
    ret ans;

}

Compilation message

fun.cpp: In function 'void dfs(int, int)':
fun.cpp:20:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |     if (ans.size() == n){
      |         ~~~~~~~~~~~^~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Incorrect 1 ms 344 KB Invalid size
6 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Incorrect 1 ms 344 KB Invalid size
6 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Incorrect 1 ms 344 KB Invalid size
5 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 61 ms 352 KB Output is correct
6 Correct 21 ms 300 KB Output is correct
7 Correct 17 ms 292 KB Output is correct
8 Execution timed out 2082 ms 2292 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Incorrect 1 ms 344 KB Invalid size
6 Halted 0 ms 0 KB -