제출 #1206195

#제출 시각아이디문제언어결과실행 시간메모리
1206195thelegendary08Arranging Shoes (IOI19_shoes)C++17
45 / 100
18 ms4284 KiB
#include "shoes.h" #include<bits/stdc++.h> #define int long long #define f0r(i,n) for(int i = 0; i<n; i++) #define pb push_back #define vi vector<int> using namespace std; int count_swaps(std::vector<signed> s) { int n = s.size(); if(n == 2){ if(s[0] < 0)return 0; else return 1; } else{ vi rs; f0r(i,n){ if(s[i] > 0)rs.pb(i); } vi tar; for(int i = 1; i<n; i+=2){ tar.pb(i); } int ans = 0; f0r(i, rs.size()){ ans += abs(rs[i] - tar[i]); } return ans; } 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...