제출 #1053498

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1053498		Dennis_Jason	Pairs (IOI07_pairs)	C++14	30 / 100	14 ms	2136 KiB

pairs

#include <bits/stdc++.h>
#define NMAX 100001
#define int long long
#define pb push_back
#define eb emplace_back
#define MOD 1000000007
#define nl '\n'
#define INF  1000000007
#define LLONG_MAX 9223372036854775807
#define pii pair<int,int>
#define tpl tuple<int,int,int,int>
//#pragma GCC optimize("O3")
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
/*
 *
 *
    ----------------DEMONSTRATION-------------------

    ---------------------END------------------------

 */
/*-------------Initialize------------*/
int b,n,d,m;
int v[NMAX];
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin>>b>>n>>d>>m;
    if(b==1)
    {
        for(int i=1;i<=n;++i)
        {
            cin>>v[i];
        }
        sort(v+1,v+1+n);
        int res=0;
        for(int i=1;i<=n;++i)
        {
            int st=i+1;
            int dr=n;
            int ans=-1;
            while(st<=dr)
            {
                int mid=(st+dr)/2;
                if(abs(v[i]-v[mid])<=d)
                {
                    ans=mid;
                    st=mid+1;
                }
                else
                    dr=mid-1;
            }
            if(ans==-1)
                continue;
            res+=(ans-i);
        }
        cout<<res;
    }

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

pairs.cpp:9: warning: "LLONG_MAX" redefined
    9 | #define LLONG_MAX 9223372036854775807
      | 
In file included from /usr/lib/gcc/x86_64-linux-gnu/10/include/limits.h:195,
                 from /usr/lib/gcc/x86_64-linux-gnu/10/include/syslimits.h:7,
                 from /usr/lib/gcc/x86_64-linux-gnu/10/include/limits.h:34,
                 from /usr/include/c++/10/climits:42,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:39,
                 from pairs.cpp:1:
/usr/include/limits.h:135: note: this is the location of the previous definition
  135 | #  define LLONG_MAX __LONG_LONG_MAX__
      |

• 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