oj.uz

Submission #643442

# Submission time Handle Problem Language Result Execution time Memory
643442 2022-09-22T03:41:07 Z CDuong Matching (CEOI11_mat) C++14
63 / 100
 2000 ms 10224 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
#define taskname "bai3"
#define int long long
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
#define pii pair<int, int>
using namespace std;
const int mxN = 1e6 + 5;
const int mod = 1e9 + 7;
const int oo = 1e18;
int n, m, sx[mxN], a[mxN];
void solve(){
    cin >> n >> m;
    for(int i = 1; i <= n; ++i) cin >> sx[i];
    for(int i = 1; i <= m; ++i) cin >> a[i];
    vector<int> v;
    for(int i = 1; i <= m - n + 1; ++i){
        int lst = 0;
        bool flag = false;
        for(int j = i; j < i + n; ++j){
            int tmp = a[sx[j - i + 1] + i - 1];
            if(tmp < lst){
                flag = true;
                break;
            }
            else lst = tmp;
        }
        if(!flag) v.pb(i);
    }
    cout << v.size() << endl;
    for(int tmp : v){
        cout << tmp << " ";
    }
    cout << endl;
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //freopen(taskname".inp", "r", stdin);
    //freopen(taskname".out", "w", stdout);
    int t = 1; //cin >> t;
    while(t--) solve();
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 596 KB Output is correct
2 Correct 4 ms 592 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 664 KB Output is correct
2 Correct 16 ms 596 KB Output is correct
3 Correct 1 ms 340 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1373 ms 2120 KB Output is correct
2 Correct 32 ms 2008 KB Output is correct
3 Correct 24 ms 2316 KB Output is correct
4 Correct 24 ms 2380 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1901 ms 2976 KB Output is correct
2 Correct 21 ms 2108 KB Output is correct
3 Correct 727 ms 2652 KB Output is correct
4 Correct 32 ms 5068 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1632 ms 3092 KB Output is correct
2 Correct 175 ms 2340 KB Output is correct
3 Correct 327 ms 2256 KB Output is correct

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2074 ms 10104 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 2072 ms 10224 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 2054 ms 8780 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 2079 ms 9560 KB Time limit exceeded
2 Halted 0 ms 0 KB -