Submission #1091449

#	Time	Username	Problem	Language	Result	Execution time	Memory
1091449		Almonther	September (APIO24_september)	C++17	55 / 100	1067 ms	1108 KiB

september

#include <bits/stdc++.h>
 
#define suiii ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define co cout<<
//#pragma GCC optimize("O3,Ofast,unroll-loops")
//#pragma GCC target("avx2,sse3,sse4,avx")
using namespace std;
//stuff
bool isvalid(vector<int>tre,vector<int>del){
    int vis[tre.size()+5]={};
    int canottake[tre.size()+5]={};
    for(auto i:del) canottake[i]=1;
    vector<ll>v[tre.size()+5];
    for(int i=0;i<tre.size();i++){
        if(tre[i]==-1) continue;
        v[tre[i]].push_back(i);
    }
    queue<ll>proces;
    proces.push(0);
    while(proces.size()){
        int num=proces.front();
        proces.pop();
        if(canottake[num]||vis[num]) continue;
        vis[num]=1;
        for(auto i:v[num]){
            proces.push(i);
        }
    }
    for(int i=0;i<tre.size();i++){
        if(vis[i]==0&&canottake[i]==0) return 0;
    }
    return 1;
}
int solve(int N,int M,vector<int>F,vector<vector<int>>S){
    ll ans=0;
    map<ll,ll>mp[M+5];
    for(int i=1;i<N;i++){
        int isgood=1;
        for(int j=0;j<M;j++){
            vector<int>curr;
            for(int k=0;k<i;k++){
                curr.push_back(S[j][k]);
                mp[j][S[j][k]]=1;
            }
            if(!isvalid(F,curr)||mp[j]!=mp[0]) isgood=0;
        }
        ans+=isgood;
    }
    return ans;
}

Compilation message (stderr)

september.cpp: In function 'bool isvalid(std::vector<int>, std::vector<int>)':
september.cpp:15:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for(int i=0;i<tre.size();i++){
      |                 ~^~~~~~~~~~~
september.cpp:30:18: 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<tre.size();i++){
      |                 ~^~~~~~~~~~~

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