Submission #785920

#	Time	Username	Problem	Language	Result	Execution time	Memory
785920		canadavid1	Pairs (IOI07_pairs)	C++14	30 / 100	44 ms	1564 KiB

pairs

#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x),end(x)
using i64 = int64_t;
// idea: k-d tree


namespace d1
{
void d1() 
{
    int N,D,M;
    cin >> N >> D >> M;
    vector<int> p(N);
    for(auto && i : p) cin >> i;
    sort(all(p));
    i64 c=0;
    for(int i = 0; i < p.size();i++)
    {
        // binary search for furthest after it
        int thrs = p[i]+D;
        int l = i;
        int r = p.size();
        while(r-l > 1)
        {
            int m = (r+l)/2;
            if(p[m]>thrs) r = m;
            else l = m;
        }
        c += (l-i);
    }
    cout << c << "\n";
}
} // d1
void d2()
{

}
void d3()
{

}

int main()
{
    int B;
    cin >> B;
    switch(B)
    {
        case 1: d1::d1();break;
        case 2: d2();break;
        case 3: d3();break;
    }
}

Compilation message (stderr)

pairs.cpp: In function 'void d1::d1()':
pairs.cpp:18:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for(int i = 0; i < p.size();i++)
      |                    ~~^~~~~~~~~~

• Subtask 1: 6 / 6
• Subtask 2: 6 / 6
• Subtask 3: 6 / 6
• Subtask 4: 6 / 6
• Subtask 5: 6 / 6
• Subtask 6: 0 / 7
• Subtask 7: 0 / 7
• Subtask 8: 0 / 8
• Subtask 9: 0 / 8
• Subtask 10: 0 / 10
• Subtask 11: 0 / 10
• Subtask 12: 0 / 10
• Subtask 13: 0 / 10