제출 #998783

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
998783		THXuan	9월 (APIO24_september)	C++17	45 / 100	121 ms	33072 KiB

september

#include <bits/stdc++.h>
#include "september.h"
#include <bits/stdc++.h>
#define INF 1e18
using namespace std;
typedef long long ll;
 
vector<int>adj[800005];
int dp[800005];
 
void dfs(int s, int e){
    for(auto u : adj[s]){
        if(u==e) continue;
        dfs(u, s);
        dp[s] = max(dp[s], dp[u]);
    }
}
 
int solve(int N, int M, vector<int> F, vector<vector<int>>S) {
    for(int i = 0;i<N;i++){
        adj[i].clear();
        dp[i] = 0;
    }
    for(int i =1; i < N;i++){
        adj[i].push_back(F[i]);
        adj[F[i]].push_back(i);
    }
    int ans = INF;
    for(int j =0;j<M;j++){
        for(int i = 0;i<S[j].size();i++){
            dp[S[j][i]] = i;
        }
        dfs(0, -1);
        int anss = 0; int i=0;
        while(i < S[j].size()){
            int maxn = dp[S[j][i]];
            int k = i;
            while(k <= maxn){
                maxn = max(maxn, dp[S[j][k]]);
                ++k;
            }
            ++anss;
            i = maxn + 1;
        }
        ans = min(ans, anss);
    }
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

september.cpp: In function 'int solve(int, int, std::vector<int>, std::vector<std::vector<int> >)':
september.cpp:4:13: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
    4 | #define INF 1e18
      |             ^~~~
september.cpp:28:15: note: in expansion of macro 'INF'
   28 |     int ans = INF;
      |               ^~~
september.cpp:30:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |         for(int i = 0;i<S[j].size();i++){
      |                       ~^~~~~~~~~~~~
september.cpp:35:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |         while(i < S[j].size()){
      |               ~~^~~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 5 / 5
• Subtask 4: 9 / 9
• Subtask 5: 0 / 5
• Subtask 6: 0 / 11
• Subtask 7: 9 / 9
• Subtask 8: 11 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16