제출 #1093886

#제출 시각아이디문제언어결과실행 시간메모리
1093886vtnooArranging Shoes (IOI19_shoes)C++17
10 / 100
0 ms348 KiB
#include "shoes.h"

long long count_swaps(std::vector<int> s) {
	//1. (10 points)
	//2. (20 points)
	//3. (20 points) All the shoes are of the same size.	
	int ans=0;
	if(s[0]>0&&s[1]<0)ans++;
	return ans;
}
#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...