oj.uz

Submission #671592

# Submission time Handle Problem Language Result Execution time Memory
671592 2022-12-13T09:06:50 Z viwlesxq Star triangles (IZhO11_triangle) C++17
100 / 100
 281 ms 13152 KB 
#include <bits/stdc++.h>
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef string str;

#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
void freo(str x) {freopen((x + ".in").c_str(), "r", stdin);freopen((x + ".out").c_str(), "w", stdout);}
 
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin >> n;
	int x[n], y[n];
	map <int, ll> mpx, mpy;
	for (int i = 0; i < n; i++) {
		cin >> x[i] >> y[i];
		mpx[x[i]]++;
		mpy[y[i]]++;
	}
	ll ans = 0;
	for (int i = 0; i < n; i++) {
		ans += (mpx[x[i]] - 1) * (mpy[y[i]] - 1);
	}
	cout << ans;
}

Compilation message

triangle.cpp: In function 'void freo(str)':
triangle.cpp:21:26: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 | void freo(str x) {freopen((x + ".in").c_str(), "r", stdin);freopen((x + ".out").c_str(), "w", stdout);}
      |                   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
triangle.cpp:21:67: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 | void freo(str x) {freopen((x + ".in").c_str(), "r", stdin);freopen((x + ".out").c_str(), "w", stdout);}
      |                                                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 9 ms 1108 KB Output is correct
13 Correct 6 ms 1236 KB Output is correct
14 Correct 9 ms 1684 KB Output is correct
15 Correct 109 ms 7076 KB Output is correct
16 Correct 103 ms 7360 KB Output is correct
17 Correct 107 ms 7148 KB Output is correct
18 Correct 97 ms 7108 KB Output is correct
19 Correct 268 ms 12492 KB Output is correct
20 Correct 191 ms 10172 KB Output is correct
21 Correct 281 ms 13152 KB Output is correct
22 Correct 278 ms 13132 KB Output is correct