Submission #533501

#	Time	Username	Problem	Language	Result	Execution time	Memory
533501		devariaota	Arranging Shoes (IOI19_shoes)	C++17	0 / 100	1 ms	204 KiB

shoes

#include <bits/stdc++.h>
using namespace std;
 
typedef int ll;
typedef double db;
#define pairll pair<ll,ll>
#define lpairll pair<ll,pairll>
 
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define repp(i,a,b) for(ll i = (a); i <= (b); i++)
#define repm(i, a, b) for (ll i = (a); i >= (b); i--)
#define repz(i, a, b) for (ll i = (a); i < (b); i++)
 
const long long MOD = 1e9+7, N = 5e3 + 5, M = 1e3+5, INF = 1e9; 

ll tc = 1, n, m,k;
string s, ye = "YES", no = "NO", nu;
bool ex[N];

void fastt(){  
  ios_base::sync_with_stdio(0); 
  cin.tie(NULL);
  cout.tie(NULL); 
}

// void input(){
//   cin >> n;
//   repp(i,1,2*n){
//     cin >> ar[i];
//   }
// } 

void count_swaps(vector<ll> v){
  cout << (v[0] > 0) << endl;
}

// int main(){
//   // freopen("input.txt", "r", stdin);
//   // freopen("output.txt", "w", stdout);
//   fastt();
//   while(tc--){
//     input();
//     count_swaps();
//   }
// }

/*
3
1 2 3

1 2 3

5
2 8 6 3 1
1 2 3 6 8

(n-1)/2

*/

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15