oj.uz

Submission #158253

# Submission time Handle Problem Language Result Execution time Memory
158253 2019-10-15T19:11:49 Z brcode Pairs (IOI07_pairs) C++14
30 / 100
 124 ms 1940 KB 
#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
const int MAXN = 2e5+5;
long long ans;
queue<int> s1;
int arr[MAXN];
int main(){
    int b,n,d,m;
    cin>>b>>n>>d>>m;
    if(b==1){
        for(int i=1;i<=n;i++){
            cin>>arr[i];
        }
        sort(arr+1,arr+n+1);
        for(int i=1;i<=n;i++){

            while(s1.size() && s1.front()<arr[i]-d){
                s1.pop();
            }
            ans+=(s1.size());
            s1.push(arr[i]);
        }
        cout<<ans<<endl;

    }

}

Subtask #1
6.0 / 6.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 #2
6.0 / 6.0

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

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 756 KB Output is correct
2 Correct 44 ms 1400 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 632 KB Output is correct
2 Correct 79 ms 1940 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 652 KB Output is correct
2 Correct 79 ms 1656 KB Output is correct
3 Correct 79 ms 1788 KB Output is correct

Subtask #6
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -