제출 #143648

#제출 시각아이디문제언어결과실행 시간메모리
143648ignaciocantaArranging Shoes (IOI19_shoes)C++14
0 / 100
2 ms376 KiB
#include "shoes.h"

using namespace std;

#define forsn(i, s, n) for(int i=s;i<int(n);i++)
#define forn(i, n) forsn(i, 0, n)
#define all(v) v.begin(), v.end()

long long count_swaps(std::vector<int> s) {
	int n = s.size();
	int cont = 0;
	forn(i, n){
	if(s[i] < 0) cont++;
	}
	return cont;
}
#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...