Submission #198908

#TimeUsernameProblemLanguageResultExecution timeMemory
198908kshitij_sodaniArranging Shoes (IOI19_shoes)C++17
0 / 100
5 ms376 KiB
#include <iostream> #include <bits/stdc++.h> using namespace std; typedef long long int llo; #define mp make_pair #define pb push_back #define a first #define b second #include "shoes.h" long long count_swaps(vector<int> s){ long long n=s.size(); if(n==1){ if(s[0]<0){ return 0; } else{ return 1; } } return ((n*(n-1))/2); return 1; }
#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...