oj.uz

Submission #132020

# Submission time Handle Problem Language Result Execution time Memory
132020 2019-07-18T08:08:13 Z Vardanyan Matching (CEOI11_mat) C++14
54 / 100
 2000 ms 31440 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1000*1000+5;
int a[N];
int b[N];
int pos[N];
int main(){
    ios_base::sync_with_stdio(false);
    int n,m;
    cin>>n>>m;
    for(int i = 1;i<=n;i++){
            cin>>a[i];
            pos[i] = a[i];
    }
    for(int i = 1;i<=m;i++) cin>>b[i];
    vector<int> ans;
    set<int> ms;
    for(int i = 1;i<=n;i++) ms.insert(b[i]);
    for(int i = 1;i<=m;i++){
        if(i+n-1>m) break;
        int nax = 0;
        bool f = true;
        if(*(ms.begin()) == b[pos[1]+i-1] && *(++ms.begin()) == b[pos[2]+i-1] && *(--ms.end()) == b[pos[n]+i-1]){
            for(int j = 1;j<=n;j++){
                int x = pos[j];
                if(b[x+i-1]<nax){
                    f = false;
                    break;
                }
                nax = b[x+i-1];
            }
        }
        else f = false;
        if(f) ans.push_back(i);
        ms.erase(ms.find(b[i]));
        ms.insert(b[i+n]);
    }
    cout<<ans.size()<<endl;
    for(int i = 0;i<ans.size();i++) cout<<ans[i]<<" ";
    cout<<endl;
    return 0;
}

Compilation message

mat.cpp: In function 'int main()':
mat.cpp:40:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i<ans.size();i++) cout<<ans[i]<<" ";
                   ~^~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 544 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 760 KB Output is correct
2 Correct 9 ms 760 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 796 KB Output is correct
2 Correct 20 ms 760 KB Output is correct
3 Correct 3 ms 376 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1294 ms 4780 KB Output is correct
2 Correct 64 ms 2808 KB Output is correct
3 Correct 168 ms 6008 KB Output is correct
4 Correct 172 ms 6108 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1838 ms 5832 KB Output is correct
2 Correct 106 ms 3408 KB Output is correct
3 Correct 722 ms 4532 KB Output is correct
4 Correct 56 ms 4592 KB Output is correct

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2005 ms 5980 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2035 ms 27356 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2021 ms 31440 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2040 ms 15432 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2025 ms 18128 KB Time limit exceeded
2 Halted 0 ms 0 KB -