oj.uz

답안 #703782

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
703782 2023-02-28T11:40:39 Z weakweakweak Volontiranje (COCI21_volontiranje) C++14
0 / 110
 1000 ms 71508 KB 
#include <bits/stdc++.h>
using namespace std;

#define fs first
#define sc second
#define pii pair<int,int>

const int N=1010000;
int a[N], fr[N], n, lb[N];
vector<int>lis={INT_MAX}, v;
vector<pii> lv[N];
vector<vector<int>>ans;
set<int>st[N];
bool dead[N]={0};

#pragma GCC optimize("Ofast")

bool dfs(int i, int t){
    if(dead[i])return 0;
    v.push_back(i);
    if(t==1)return 1;
    auto it=st[t-1].lower_bound(lb[i]), it2=st[t-1].lower_bound(i);
    while(it!=it2){
        if(dfs(*it, t-1))return 1;
        it=it++;
    }
    v.pop_back();
    dead[i]=1;
    return 0;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n;
    for(int i=1; i<=n; i++){
        cin >> a[i];
        auto it=lower_bound(lis.begin(), lis.end(), a[i]);
        if(it==lis.end())lis.push_back(a[i]), fr[i]=lis.size();
        else lis[it-lis.begin()]=a[i], fr[i]=it-lis.begin()+1;
        st[fr[i]].insert(i); lv[fr[i]].push_back({a[i],i});
        if(fr[i]==1)continue;
        int l=0, r=lv[fr[i]-1].size()-1;
        while(l<r){
            int mid=(l+r)/2;
            if(lv[fr[i]-1][mid].fs < a[i])r=mid;
            else l=mid+1;
        }
        lb[i]=lv[fr[i]-1][l].sc;
    }

    for(auto i:st[lis.size()]){
        v.resize(0);
        if(dfs(i, lis.size())){
            if(v.size()!=lis.size())continue;
            reverse(v.begin(), v.end());
            ans.push_back(v);
            for(int i=0; i<v.size()-1; i++)st[i+1].erase(v[i]);
        }
    }

    cout << ans.size() << ' ' << lis.size() << '\n';
    for(auto v:ans){
        for(int x:v)cout << x << ' ';
        cout << '\n';
    }
return 0;}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:57:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |             for(int i=0; i<v.size()-1; i++)st[i+1].erase(v[i]);
      |                          ~^~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 71380 KB Output is correct
2 Correct 35 ms 71396 KB Output is correct
3 Correct 41 ms 71412 KB Output is correct
4 Correct 34 ms 71508 KB Output is correct
5 Correct 36 ms 71396 KB Output is correct
6 Correct 36 ms 71436 KB Output is correct
7 Correct 32 ms 71432 KB Output is correct
8 Correct 32 ms 71408 KB Output is correct
9 Correct 32 ms 71488 KB Output is correct
10 Correct 31 ms 71420 KB Output is correct
11 Correct 34 ms 71452 KB Output is correct
12 Correct 33 ms 71484 KB Output is correct
13 Correct 31 ms 71380 KB Output is correct
14 Correct 36 ms 71476 KB Output is correct
15 Correct 40 ms 71488 KB Output is correct
16 Correct 32 ms 71364 KB Output is correct
17 Execution timed out 1081 ms 71372 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 71380 KB Output is correct
2 Correct 35 ms 71396 KB Output is correct
3 Correct 41 ms 71412 KB Output is correct
4 Correct 34 ms 71508 KB Output is correct
5 Correct 36 ms 71396 KB Output is correct
6 Correct 36 ms 71436 KB Output is correct
7 Correct 32 ms 71432 KB Output is correct
8 Correct 32 ms 71408 KB Output is correct
9 Correct 32 ms 71488 KB Output is correct
10 Correct 31 ms 71420 KB Output is correct
11 Correct 34 ms 71452 KB Output is correct
12 Correct 33 ms 71484 KB Output is correct
13 Correct 31 ms 71380 KB Output is correct
14 Correct 36 ms 71476 KB Output is correct
15 Correct 40 ms 71488 KB Output is correct
16 Correct 32 ms 71364 KB Output is correct
17 Execution timed out 1081 ms 71372 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 71380 KB Output is correct
2 Correct 35 ms 71396 KB Output is correct
3 Correct 41 ms 71412 KB Output is correct
4 Correct 34 ms 71508 KB Output is correct
5 Correct 36 ms 71396 KB Output is correct
6 Correct 36 ms 71436 KB Output is correct
7 Correct 32 ms 71432 KB Output is correct
8 Correct 32 ms 71408 KB Output is correct
9 Correct 32 ms 71488 KB Output is correct
10 Correct 31 ms 71420 KB Output is correct
11 Correct 34 ms 71452 KB Output is correct
12 Correct 33 ms 71484 KB Output is correct
13 Correct 31 ms 71380 KB Output is correct
14 Correct 36 ms 71476 KB Output is correct
15 Correct 40 ms 71488 KB Output is correct
16 Correct 32 ms 71364 KB Output is correct
17 Execution timed out 1081 ms 71372 KB Time limit exceeded
18 Halted 0 ms 0 KB -