제출 #1273942

#제출 시각아이디문제언어결과실행 시간메모리
1273942almazArranging Shoes (IOI19_shoes)C++20
10 / 100
13 ms1964 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

// #define int long long
// #define endl '\n'
#define ff first
#define ss second
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ar array

const int MOD = 1e9 + 7, N = 2e5 + 5;

long long INF = 1e18;

long long count_swaps(std::vector<int> s) {
	int n = s.size();
	long long ans = 0;
	for(int i = 0;i < n;i += 2){
		if(s[i] > 0){
			ans++;
		}
		if(s[i + 1] < 0){
			ans++;
		}
	}
	return (ans >> 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...