제출 #994063

#제출 시각아이디문제언어결과실행 시간메모리
994063TgX_2Arranging Shoes (IOI19_shoes)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h>
using namespace std;


int count_swaps(vector<int> s) {
    int cnt = 0;
    int n = s.size();
    for(int i = 0; i < n; i++) {
        if (i & 1 and s[i] < 0) cnt++;
        else if (i % 2 == 0 and s[i] > 0) cnt++;
    }
    return cnt;
}
#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...