Submission #60345135

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
int main(void){
    int n, m;
    cin >> n >> m;
    vector<int> aa(n), ans(m);
    vector<pair<int, int>> a(n), b(m);
    for(int i=0; i<n; i++){
        cin >> a[i].first;
        a[i].second = i;
        aa[i] = a[i].first;
    }
    for(int i=0; i<m; i++){
        cin >> b[i].first;
        b[i].second = i;
        
    }
    int min = *min_element(begin(aa), end(aa));
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    /*
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
int main(void){
    int n, m;
    cin >> n >> m;
    vector<int> aa(n), ans(m);
    vector<pair<int, int>> a(n), b(m);
    for(int i=0; i<n; i++){
        cin >> a[i].first;
        a[i].second = i;
        aa[i] = a[i].first;
    }
    for(int i=0; i<m; i++){
        cin >> b[i].first;
        b[i].second = i;
        
    }
    int min = *min_element(begin(aa), end(aa));
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    /*
    for(int i=0; i<n; i++){
        cout <<  a[i].first << " " << a[i].second << endl;
    }
    
    cout << endl;
    for(int i=0; i<m; i++){
        cout << b[i].first << " " << b[i].second << endl;
    }*/
    
    int pos = 0;
    int tmp = 10000000;
    for(int i=0; i<m; i++){
        ans[b[i].second] = tmp;
        if(b[i].first < min){
            ans[b[i].second] = -1;
            continue;
        }
        for(int j=pos; j<n; j++){
            
            if(b[i].first < a[j].first) continue;
            if(ans[b[i].second] == tmp){
                if(j != m-1 && b[j].first == b[j+1].first){
                    pos = j;
                }else{
                    pos = j + 1;
                }
            }
            if(ans[b[i].second] > a[j].second + 1){
                ans[b[i].second] =  a[j].second + 1;
            }
            
            //cout << a[j].second << " " << b[j].second << endl;
            //cout << a[j].second + 1 << endl;
            //if(i != m-1 && b[i] != b[i+1])
        }
    }
    
    for(int i=0; i<m; i++){
        cout << ans[i] << endl;
    }
    
}

Submission Info

Judge Result