oj.uz

Submission #1040676

# Submission time Handle Problem Language Result Execution time Memory
1040676 2024-08-01T08:24:55 Z 변재우(#10999) The Ties That Guide Us (CEOI23_incursion) C++17
0 / 100
 145 ms 13100 KB 
#include "incursion.h"
#include <bits/stdc++.h>
using namespace std;

namespace asdf {
  const int Nmax=45010;
  int N;
  vector<int> adj[Nmax], ret;
  void DFS(int curr, int prev, int x) {
    ret[curr-1]=x;
    for(int next:adj[curr]) if(next!=prev) DFS(next, curr, x+1);
  }
  vector<int> mark(vector<pair<int, int>> F, int safe) {
    N=F.size()+1;
    for(int i=0; i<N-1; i++) adj[F[i].first].push_back(F[i].second), adj[F[i].second].push_back(F[i].first);
    ret.resize(N);
    DFS(safe, -1, 0);
    return ret;
  }
}

namespace qwer {
  const int Nmax=45010;
  int N;
  vector<int> adj[Nmax];
  void DFS(int curr, int prev, int val) {
    for(int next:adj[curr]) if(next!=prev) {
      int tmp=visit(next);
      if(!tmp) return;
      if(tmp<val) DFS(next, curr, tmp);
      else visit(curr);
    }
  }
  void locate(vector<pair<int, int>> F, int curr, int t) {
    N=F.size()+1;
    for(int i=0; i<N-1; i++) adj[F[i].first].push_back(F[i].second), adj[F[i].second].push_back(F[i].first);
    if(!t) return;
    DFS(curr, 0, t);
  }
}

std::vector<int> mark(std::vector<std::pair<int, int>> F, int safe) {
  return asdf::mark(F, safe);
}

void locate(std::vector<std::pair<int, int>> F, int curr, int t) {
  qwer::locate(F, curr, t);
}

Compilation message

interface.cpp: In function 'int main()':
interface.cpp:44:55: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |     if(fread(T.data(), sizeof(int), 2 * N - 2, stdin) != 2 * N - 2) exit(0);
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
interface.cpp:50:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |         int l = (numbers.size() == N ? N : 0);
      |                  ~~~~~~~~~~~~~~~^~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 5116 KB Partially correct

Subtask #1
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 145 ms 13040 KB Partially correct
2 Partially correct 142 ms 13100 KB Partially correct
3 Partially correct 86 ms 11684 KB Partially correct
4 Incorrect 81 ms 11208 KB Not correct
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Partially correct 67 ms 10120 KB Partially correct
2 Incorrect 76 ms 10152 KB Not correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 5116 KB Partially correct
2 Partially correct 145 ms 13040 KB Partially correct
3 Partially correct 142 ms 13100 KB Partially correct
4 Partially correct 86 ms 11684 KB Partially correct
5 Incorrect 81 ms 11208 KB Not correct
6 Halted 0 ms 0 KB -