제출 #440651

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
440651		Parisa	Planinarenje (COCI18_planinarenje)	C++17	96 / 160	8 ms	588 KiB

planinarenje

#include<bits/stdc++.h>
#include<string>
using namespace std;
#define S second
#define F first
#define pb push_back
#define MP make_pair
#define ll long long
#define PAIR pair <ll ,ll >
#define reversee(x) reverse(x.begin(), x.end());
#define sortt(x) sort(x.begin(), x.end());
#define flash ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define cout(l) cout<<fixed<<setprecision(10)<<l;
const ll maxn=1e3+10, mod=1e9+7 , inf=2e9 , lg=20;
ll mark[maxn] , match[maxn] , fmatch[maxn];
vector<ll> adj[maxn];
bool dfs(ll v){
    mark[v]=1;
    for(auto u:adj[v]){
        if(match[u]==-1 || (!mark[match[u]] && dfs(match[u]))) {
            match[u]=v;
            return 1;
        }

    }
    return 0;
}
int main(){
    ll n , m;
    cin>>n>>m;
    for(int i=0;i<m;i++){
        ll x, y;
        cin>>x>>y;
        x-- , y--;
        adj[x].pb(y);

    }
    memset(match , -1 , sizeof(match));
    bool flag=1;
    while(flag){
        flag=0;
        memset(mark , 0 , sizeof(mark));
        for(int i=0;i<n;i++){
            if(!fmatch[i] && dfs(i)){
                flag=fmatch[i]=1;

            }
        }
    }
    for(int i=0;i<n;i++){
        if(!fmatch[i]){
            dfs(i);
        }
    }
    for(int i=0;i<n;i++){
        if(mark[i]) cout<<"Mirko"<<endl;
        else cout<<"Slavko"<<endl;
    }

}

컴파일 시 표준 에러 (stderr) 메시지

planinarenje.cpp: In function 'int main()':
planinarenje.cpp:45:31: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   45 |                 flag=fmatch[i]=1;
      |                      ~~~~~~~~~^~

• Subtask 1: 16 / 16
• Subtask 2: 16 / 16
• Subtask 3: 16 / 16
• Subtask 4: 16 / 16
• Subtask 5: 0 / 16
• Subtask 6: 16 / 16
• Subtask 7: 16 / 16
• Subtask 8: 0 / 16
• Subtask 9: 0 / 16
• Subtask 10: 0 / 16