fork download
copy 
  1. #include <vector>
  2. #include <list>
  3. #include <map>
  4. #include <set>
  5. #include <queue>
  6. #include <deque>
  7. #include <stack>
  8. #include <bitset>
  9. #include <algorithm>
  10. #include <functional>
  11. #include <numeric>
  12. #include <utility>
  13. #include <sstream>
  14. #include <iostream>
  15. #include <iomanip>
  16. #include <cstdio>
  17. #include <cmath>
  18. #include <cstdlib>
  19. #include <ctime>
  20. #include <cstring>
  21. #include <math.h> 
  22. #define lli long long int
  23. using namespace std;
  24.  
  25. int main(){
  26. 	// 1 1 2 3 3 
  27. 	lli n;
  28. 	cin >> n;
  29. 	lli a[n];
  30. 	lli best = 0;
  31. 	lli worst = 1e9+1;
  32. 	for(int i = 0; i < n; i++){
  33. 		cin >> a[i];
  34. 		//best = max(best, a[i]);
  35. 		//worst = min(worst, a[i]);
  36. 	}
  37. 	sort(a, a+n);
  38. 	bool yn = true;
  39. 	bool xn = true;
  40. 	lli s;
  41. 	s = a[n/2];
  42.  
  43. 	lli init = abs(a[0] - s); 
  44. 	for(int i = 1; i < n; i++){
  45. 		if( abs(a[i] - s) == init || a[i] == s){
  46. 			yn = true;
  47. 		}
  48. 		else{
  49. 			yn = false;
  50. 			break;
  51. 		}
  52. 	}
  53.  
  54.  
  55. 	if(yn){
  56. 		cout << "YES";
  57. 		fflush(stdout);
  58. 	}
  59. 	else{
  60. 		cout << "NO";
  61. 		fflush(stdout);
  62. 	}
  63.  
  64. }
Time limit exceeded #stdin #stdout 5s 1054208KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/L9PBla
language:
C++ (gcc 8.3)
created:
8 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!