Submission #780942

#	Time	Username	Problem	Language	Result	Execution time	Memory
780942		cig32	Volontiranje (COCI21_volontiranje)	C++17	10 / 110	1 ms	340 KiB

Main

#include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAXN = 1e6 + 10;
const int MOD = 998244353;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
  if(p==0) return 1 % MOD;
  int r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
int inv(int b) { 
  return bm(b, MOD-2);
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
void solve(int tc){
  int n;
  cin>>n;
  int p[n+1];
  for(int i=1;i<=n;i++)cin>>p[i];
  int dp[n+1];
  int bucket[n+1];
  for(int i=1;i<=n;i++)bucket[i]=1e9,dp[i]=1;
  for(int i=1;i<=n;i++){
    auto it=lower_bound(bucket+1,bucket+1+n,p[i]);
    dp[i]=distance(bucket,it);
    bucket[dp[i]]=min(bucket[dp[i]],p[i]);
  }
  int lis=0;
  for(int i=1;i<=n;i++)lis=max(lis,dp[i]);
  int pos[n+1];
  for(int i=1;i<=n;i++)pos[p[i]]=i;
  bool used[n+1];
  for(int i=1;i<=n;i++)used[i]=0;
  vector<vector<int>>ans;
  vector<int>ok[n+1];
  for(int i=1;i<=n;i++)ok[dp[i]].push_back(i);
  for(int x:ok[lis]){
    vector<int>seq;
    seq.push_back(x);
    used[x]=1;
    for(int i=lis-1;i>=1;i--){
      int lb=0,rb=ok[i].size()-1;
      while(lb<rb){
        int mid=(lb+rb)>>1;
        if(p[ok[i][mid]]>p[seq.back()]) lb=mid+1;
        else rb=mid;
      }
      if(p[ok[i][lb]]>p[seq.back()]) break;
      for(int j=lb; j<ok[i].size(); j++) {
        if(!used[ok[i][j]]) {
          used[ok[i][j]]=1;
          seq.push_back(ok[i][j]);
          break;
        }
      }
    }
    reverse(seq.begin(),seq.end());
    bool bad=0;
    for(int i=1;i<seq.size();i++)if(seq[i-1]>seq[i])bad=1;
    if(bad || seq.size()!=lis) {
      for(int x:seq)used[x]=0;
      continue;
    }
    ans.push_back(seq);
  }
  cout<<ans.size()<<" "<<lis<<"\n";
  for(vector<int>v:ans){
    for(int x:v)cout<<x<<" ";
    cout<<"\n";
  }
}
int32_t main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
// 勿忘初衷

Compilation message (stderr)

Main.cpp: In function 'void solve(long long int)':
Main.cpp:57:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |       for(int j=lb; j<ok[i].size(); j++) {
      |                     ~^~~~~~~~~~~~~
Main.cpp:67:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     for(int i=1;i<seq.size();i++)if(seq[i-1]>seq[i])bad=1;
      |                 ~^~~~~~~~~~~
Main.cpp:68:25: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   68 |     if(bad || seq.size()!=lis) {
      |               ~~~~~~~~~~^~~~~
Main.cpp:38:7: warning: variable 'pos' set but not used [-Wunused-but-set-variable]
   38 |   int pos[n+1];
      |       ^~~

• Subtask 1: 10 / 10
• Subtask 2: 0 / 40
• Subtask 3: 0 / 60