oj.uz

Submission #731027

# Submission time Handle Problem Language Result Execution time Memory
731027 2023-04-26T19:49:48 Z Karpin Love Polygon (BOI18_polygon) C++17
0 / 100
 266 ms 24780 KB 
#include <bits/stdc++.h>

using namespace std;


#define ll long long
#define vt vector
#define ar array


void solve(){

    int n;
    cin >> n;

    if (n % 2 == 1){
        cout << -1 << endl;
        return;
    }

    map<string, string> loving;
    map<string, vt<string>> isLoved;

    for(int i = 0; i < n; i++){
        string a, b;
        cin >> a >> b;
        loving[a] = b;
        if (isLoved.find(b) == isLoved.end()) isLoved[b] = {};
        isLoved[b].push_back(a);
    }

    cout << n / 2 << endl;






		

}

int main(){

	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int testcases = 1;

	// cin >> testcases;

	while(testcases--){
		solve();
	}

	return 0;

}

Subtask #1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 320 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 266 ms 24780 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 320 KB Output isn't correct
3 Halted 0 ms 0 KB -