Submission #776784

#TimeUsernameProblemLanguageResultExecution timeMemory
776784vjudge1Sajam (COCI18_sajam)C++17
15 / 90
37 ms2296 KiB
#include <bits/stdc++.h> using namespace std; typedef long long lo; #define fi first #define se second #define endl "\n" #define pb push_back #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(int i=1;i<=n;i++) #define mid ((start+end)/2) #define ort ((bas+son)/2) const lo inf = 1000000000; const lo li = 1005; const lo mod = 1000000007; int n,m,a[li],k,flag,t,acik[li]; int cev; string s[li]; vector<int> v; int main(void){ fio(); cin>>n>>k; FOR cin>>s[i]; FOR{ for(int j=0;j<n;j++){ if(s[i][j]=='o')acik[j]++; } } cev=k+1; FOR{ v.clear(); for(int j=0;j<n;j++){ if(s[i][j]=='o')v.pb(acik[j]); else v.pb(n-acik[j]); } sort(v.begin(),v.end()); if(n%2){ int cur=0; for(auto go:v)cur+=abs(go-v[n/2]); //~ cout<<cur<<" AAA "<<cev<<endl; cev=min(cev,cur); } else{ int cur=0; for(auto go:v)cur+=abs(go-v[n/2]); //~ cout<<cur<<" BBB "<<cev<<endl; cev=min(cev,cur); cur=0; for(auto go:v)cur+=abs(go-v[n/2-1]); //~ cout<<cur<<" CCC "<<cev<<endl; cev=min(cev,cur); } } if(cev>k)cout<<"NE\n"; else cout<<"DA\n"; return 0; }
#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...