제출 #1135869

#제출 시각아이디문제언어결과실행 시간메모리
1135869MunkhturErdenebat9월 (APIO24_september)C++20
0 / 100
1 ms2884 KiB
#include "september.h"
#include<bits/stdc++.h>
#include<string.h>
#include <algorithm>
#include <stdlib.h>
 #define ll int
using namespace std;
#include <vector>
ll i,j;
map<ll,ll> maa,mee,mii;
 ll k[100001];
vector<ll> vis[100005],vas;
int solve(int N, int M, vector<int> F, vector<vector<int>> s) {
    for(i=0 ; i<N ; i++){
        vis[i]=vas;
        k[i]=0;
        maa=mii;
        mee=mii;
    }
    for(i=1 ; i<N ; i++){
        vis[F[i]].push_back(i);
    }
    ll l=0;
    ll r=0;
    ll h=0;
   mee[0]=0;
    while(l<r){
        for(ll i=0 ; i<vis[k[l]].size() ; i++){
            k[r]=vis[k[l]][i];
            mee[k[r]]=mee[k[l]]+1;
        }
        l++;
    }
	 h=0;
	ll g=0;
	for(j=0 ; j<N-1 ; j++){
		for(i=0 ; i<M ; i++){
			if(maa[s[i][j]]==0){
				h++;
			}
			maa[s[i][j]]++;
			if(maa[s[i][j]]==M){
				h--;
			}
		}
		if(h==0 || mee[s[0][j]]<mee[s[0][j+1]]){
			g++;
		}
	}
	return g;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...