oj.uz

답안 #969742

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
969742 2024-04-25T14:14:40 Z Darren0724 Love Polygon (BOI18_polygon) C++17
54 / 100
 242 ms 10484 KB 
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
const int N=100005;
map<string,int> m;
vector<int> vis(N);
vector<int> v(N,-1),in(N),inq(N);
inline int id(string s){
    if(m.count(s)){
        return m[s];
    }
    int p=m.size();
    //cout<<s<<' '<<p<<endl;
    m[s]=p;
    return p;
}
int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;cin>>n;
    if(n&1){
        cout<<-1<<endl;
        return 0;
    }
    for(int i=0;i<n;i++){
        string a,b;cin>>a>>b;
        v[id(a)]=id(b);
        in[id(b)]++;
        if(v[id(b)]==id(a)&&a!=b){
            vis[id(a)]=vis[id(b)]=1; 
        }
    }
    int ans=0;
    queue<int> q;
    for(int i=0;i<n;i++){
        if(in[i]==0){
            q.push(i);
        }
    }
    while(q.size()){
        int p=q.front();
        q.pop();
        inq[p]++;
        //cout<<p<<endl;
        in[v[p]]--;
        if(in[v[p]]==0){
            q.push(v[p]);
        }
        if(vis[p]||vis[v[p]]){
            continue;
        }
        ans++;
        vis[p]=vis[v[p]]=1;
    }
    for(int i=0;i<n;i++){
        if(vis[i])continue;
        if(inq[i]){
            ans++;
            continue;
        }
        int sz=0,f=v[i];
        vector<int> a(1,vis[i]);
        vis[i]=1;
        while(f!=i){
            a.push_back(vis[f]);
            vis[f]=1;
            f=v[f];
        }
        int idx=0;
        for(int i=0;i<a.size();i++){
            if(a[i]==0)idx=i;
        }
        for(int i=0;i<a.size();i++){
            //cout<<a[idx]<<endl;
            if(a[idx]==0)sz++;
            else ans+=(sz+1)/2,sz=0;
            idx++;
            idx%=(int)a.size();
        }
        //assert(sz==1);
        ans+=(sz+1)/2;
    }
    cout<<ans<<endl;
 
    return 0;
}

Compilation message

polygon.cpp: In function 'int32_t main()':
polygon.cpp:70:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |         for(int i=0;i<a.size();i++){
      |                     ~^~~~~~~~~
polygon.cpp:73:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |         for(int i=0;i<a.size();i++){
      |                     ~^~~~~~~~~

Subtask #1
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Incorrect 1 ms 1884 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 225 ms 10484 KB Output is correct
5 Correct 242 ms 9712 KB Output is correct
6 Correct 236 ms 10452 KB Output is correct
7 Correct 1 ms 1880 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 210 ms 9908 KB Output is correct
2 Correct 208 ms 9808 KB Output is correct
3 Correct 177 ms 9668 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 203 ms 9684 KB Output is correct
6 Correct 195 ms 9860 KB Output is correct
7 Correct 208 ms 10060 KB Output is correct
8 Correct 210 ms 9812 KB Output is correct
9 Correct 200 ms 10140 KB Output is correct
10 Correct 159 ms 10040 KB Output is correct
11 Correct 2 ms 1884 KB Output is correct
12 Correct 1 ms 1884 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Incorrect 1 ms 1884 KB Output isn't correct
5 Halted 0 ms 0 KB -