| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1360545 | srividya_06 | September (APIO24_september) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#define int long long
#define REP(i,a,b) for(int i = a; i<b; i++)
#define RREP(i,a,b) for(int i = a; i>b; i--)
using namespace std;
int inf = 1e15;
int solve(int n, int m, vector<int> f, vector<vector<int>> s){
vector<pair<int,int>> srt;
REP(i,0,s[0].size()){
srt.push_back({s[0][i],i});
}
sort(srt.begin(),srt.end(),greater<pair<int,int>>());
int cnt = 0, curr = -1;
REP(i,0,s[0].size()){
if(srt[i].second > curr){
curr = srt[i].second;
cnt++;
}
}
return cnt;
}