Submission #1356044

#	Time	Username	Problem	Language	Result	Execution time	Memory
1356044		Toto	9월 (APIO24_september)	C++20	0 / 100	0 ms	344 KiB

september

#include "september.h"

#include <bits/stdc++.h>
using namespace std;

int solve(int n, int m, std::vector<int> F, std::vector<std::vector<int>> s) {
    vector<int> mpos(n+1,-1);
    for(int i=0;i<m;i++){
        for(int j=0;j<n-1;j++){
            mpos[s[i][j]]=max(mpos[s[i][j]],j);
        }
    }
    int pos=0,ans=0;
    for(int i=0;i<n-1;i++){
        pos=max(pos,mpos[s[0][i]]);
        if(i==pos){
            ans++; 
            //cout << i << '\n';
        }
    }
	return ans;
}

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