제출 #992671

#제출 시각아이디문제언어결과실행 시간메모리
992671ezzzayPairs (IOI07_pairs)C++14
0 / 100
4042 ms1492 KiB
#include<bits/stdc++.h> using namespace std; #define ff first #define ss second #define pb push_back const int N=3e5+5; int arr[N]; int sbtsk1(int N, int D , int M){ vector<int>v; for(int i=1;i<=N;i++){ v.pb(arr[i]); } sort(v.begin(),v.end()); int cnt=0; for(int i=0;i<N;i++){ for(int j=i+1;j<N;j++){ if(abs(v[i]-v[j])<=D)cnt++; } } cout<<cnt; } signed main(){ int B,N,D,M; cin>>B>>N>>D>>M; for(int i=1;i<=N;i++)cin>>arr[i]; if(B==1){ sbtsk1(N,D,M); return 0; } }

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

pairs.cpp: In function 'int sbtsk1(int, int, int)':
pairs.cpp:21:1: warning: no return statement in function returning non-void [-Wreturn-type]
   21 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...