fork download
copy 
  1. #include <bits/stdc++.h>
  2. #define clr(str , charr) memset(str,charr, sizeof(str))
  3. using namespace  std;
  4. const int mod = 1e9+7 ; 
  5. using namespace std::chrono;
  6. #define read(arr,n) for(int i=1;i<=n;i++)cin>>arr[i];
  7. #define write(arr,n) for(int i=1;i<=n;i++)cout<<arr[i]<<" ";
  8. #define write_rev(arr,n) for(int i=n;i>=1;i--)cout<<arr[i]<<" ";
  9.  
  10.  
  11. #define lb lower_bound 
  12. #define up upper_bound 
  13.  
  14. #define ll long long
  15. #define ld long double
  16. #define ull unsigned long long
  17. #define ull unsigned long long
  18. #define pi 3.1415926
  19.  
  20.  
  21. #define pb push_back
  22. #define mp make_pair
  23.  
  24. #define f first
  25. #define s second
  26.  
  27. #define en "\n"
  28. #define sp " "
  29. #define eps 1.0E-14
  30. #define l length()
  31. #define preci(x) cout << fixed<<setprecision(x)
  32. #define infmax LONG_LONG_MAX
  33. #define infmin LONG_LONG_MIN
  34. #define bit __builtin_popcountll /*It returns the numbers of set bits in an integer 
  35. (the number of ones in the binary representation of the integer).*/
  36.  
  37. #define all(v)			(v).begin(),(v).end()
  38. #define sz(v)			(((int)((v).size())))
  39. void fast(){
  40.  ios_base::sync_with_stdio(0);cin.tie(0); cout.tie(0);
  41. }
  42.  
  43. ll gcd(ll a, ll b){
  44.     if(b == 0) return a;
  45.     return gcd(b, a % b);
  46. }
  47.  
  48. ll lcm(ll x, ll y){return x / gcd(x, y) * y;};
  49.  
  50. ll fastpow(ll a,ll b)
  51. {
  52.   ll wynik=1;
  53.   while (b)
  54.   {
  55.     if (b&1)wynik=(wynik*a)%mod;
  56.     a=(a*a)%mod;
  57.     b>>=1;
  58.   }
  59.   return wynik;
  60. }
  61.  
  62. bool isp(ll a)
  63.  
  64.  
  65.  
  66. {
  67.   if (a == 2)return 1;
  68.   if (a%2 == 0|| a==1)return false;
  69.  
  70.   for (ll i =3 ; i*i<=a ; i+=2)
  71.   {
  72.     if (a %i ==0)return false;
  73.   }
  74.  
  75.   return true;
  76. }
  77.  
  78.  
  79. void SieveOfEratosthenes(int n)
  80. {
  81. 	bool prime[n + 1];
  82. 	memset(prime, true, sizeof(prime));
  83.  
  84. 	for (int p = 2; p * p <= n; p++)
  85. 	{
  86. 		if (prime[p] == true)
  87. 		{
  88. 			for (int i = p * p; i <= n; i += p)
  89. 				prime[i] = false;
  90. 		}
  91. 	}
  92.  
  93. 	for (int p = 2; p <= n; p++)
  94. 		if (prime[p])
  95. 			cout << p << " ";
  96. }
  97.  
  98.  
  99.  
  100. const int mx = 1e5+5 ;
  101. ll a[mx];
  102.  
  103. ll fre[mx];
  104. /*
  105. ll b[mx];
  106. ll c[mx];
  107. ll d[mx];
  108. */
  109.  
  110.  
  111. /*bool sortPairs(const pair<char, int> &x, const pair<char, int> &y)
  112. {
  113.     return (x.s > y.s);
  114. }
  115.  
  116. */
  117. int dx4[] = { -1 , 0 , 0  ,1  };
  118. int dy4[] = { 0  , 1 , -1 , 0 };
  119.  
  120. string dir [] = {"up" , "rigth" , "left" , "down"};
  121.  
  122. int dx8[] = { 0 , 0 , 1 , -1 , 1 , -1 , 1 , -1 };
  123. int dy8[] = { 1 , -1 , 0 , 0 , 1 , -1 , -1 , 1 };
  124. //bool valid(int i , int j){return i >= 0 && j >= 0 && i < n && j < m;}
  125. int pri[] = {-1 , 0 ,0, 0, 1, 1, 1, 0, 1, 0, 0,
  126.  0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0,
  127.  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0};
  128. char s[200001];
  129. void solve ()
  130. {
  131.     /*
  132.  
  133. 	#ifdef k
  134. 	freopen ("in.txt","r",stdin);
  135. 	freopen ("ou.txt","w",stdout;
  136. 	#endif
  137.  
  138.  
  139. 	    int n;
  140.     cin >> n;
  141.     vector<int> a(n);
  142.     for (int i = 0; i < n; i++) {
  143.         cin >> a[i];
  144.     }
  145.     
  146.     int ans = 1;
  147.     for (int i = 0; i < n; i++) {
  148.         for (int j = i + 1; j < n; j++) {
  149.             const int d = a[j] - a[i];
  150.             int cnt = 0;
  151.             for (int k = 0; k < n; k++) {
  152.                 if ((j - i) * a[k] == (j - i) * a[i] + (k - i) * d) {
  153.                     cnt++;
  154.                 }
  155.             }
  156.             ans = max(ans, cnt);
  157.         }
  158.     }
  159.     
  160.     ans = n - ans;
  161.     cout << ans << '\n';
  162.     */
  163. 	//freopen ("in.txt","r",stdin);
  164. 	//freopen ("ou.txt","w",stdout;
  165.  
  166. 	// 653 77 62 5 800 9
  167. 	// 800 653 90 77 62 5 
  168.  
  169. 	// P27. Scores in Order -- Day 3 - Sorting
  170.  
  171. 	int n ; cin>>n;
  172. 	vector<int> v;
  173. 	vector<int> positions;
  174. 	int pos = 1 ;
  175. 	for(int i=0 ; i<n ; ++i)
  176. 	{
  177. 		int x; cin>>x;
  178. 		v.pb(x);
  179. 		sort(v.begin(), v.end(), greater<int>());
  180. 		for(int j=0 ; j<v.size() ; ++j)
  181. 		{
  182. 			if (v[j] > x)
  183. 			{
  184. 				pos++;
  185. 			}
  186. 			else {
  187. 				positions.pb(pos);
  188. 				pos=1;
  189. 				break;
  190. 			}
  191. 		}
  192. 	}
  193.  
  194. 	for (int i=0 ; i<positions.size() ; ++i)cout << positions[i] << "\n";
  195. 	sort(v.begin(), v.end(), greater<int>());
  196. 	//sort(v.rbegin(), v.rend());
  197. 	for (int i=0 ; i<v.size() ; ++i)cout << v[i] << " ";
  198.  
  199. }
  200. void calctime(){
  201.  
  202.  
  203. 	auto start = high_resolution_clock::now();
  204.  
  205.   // code here
  206.  
  207.     solve();
  208.  
  209. 	auto stop = high_resolution_clock::now();
  210.  
  211.  
  212. 	auto duration = duration_cast<microseconds>(stop - start);
  213.  
  214. 	cout << "Time taken by function: "
  215. 		<< duration.count() << " microseconds" << endl;
  216.  
  217. }
  218.  
  219. int main() 
  220. {
  221.   fast();
  222.   //int t; cin>>t;
  223.   //while(t--)
  224.   solve();
  225.   //calctime();
  226. }
  227.  
  228.  
  229.  
Success #stdin #stdout 0.01s 5664KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/LwBYna
language:
C++14 (gcc 8.3)
created:
2 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!