제출 #417912

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
417912		rumen_m	Pairs (IOI07_pairs)	C++17	30 / 100	186 ms	6840 KiB

pairs

# include <bits/stdc++.h>
using namespace std;
vector <vector <int> > a;
int b,n,d,m;
bool cmp1(vector <int> i, vector <int> j)
{
    return i[0]<j[0];
}
void solve_1()
{
    int i,j = 0;
    sort(a.begin(),a.end(),cmp1);
    long long ans = 0;
    for(i=0;i<n;i++)
    {
        while(a[j][0]+d<a[i][0])j++;
        ans+=(i-j);
    }
    cout<<ans<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);

cin>>b>>n>>d>>m;
int i,j;
a.resize(n);
for(i=0;i<n;i++)
{
    a[i].resize(b);
    for(j=0;j<b;j++)
        cin>>a[i][j];
}
if(b==1){solve_1();return 0;}
return 0;
}

• 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