oj.uz

답안 #970897

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
970897 2024-04-27T13:28:43 Z saidpon 별들과 삼각형 (IZhO11_triangle) C++17
0 / 100
 2000 ms 8596 KB 
#include <bits/stdc++.h>
#define ordered_set tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define nemeshay ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define allr(pon) pon.rbegin(), pon.rend()
#include <ext/pb_ds/assoc_container.hpp>
#define all(pon) pon.begin(), pon.end()
#include <ext/pb_ds/tree_policy.hpp>
#define pii pair <int, int>
#define nosolve puts("-1")
#define YES puts("YES")
#define pf push_front
#define int long long
#define OK puts("OK")
#define NO puts("NO")
#define pb push_back
#define sigma signed
#define sc second
#define fr first
using namespace __gnu_pbds;
using namespace std;
const int N = 1e6 + 20, INF = 2e9 + 7;
pii a[N];
sigma main(){
    nemeshay
    map <int, int> fir, sec;
    int n, ans = 0;
    cin >> n;
    for (int i = 0; i < n; i++){
        cin >> a[i].fr >> a[i].sc;
        fir[a[i].fr]++;
        sec[a[i].sc]++;
    }
    for (int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            if (a[i] == a[j]) continue;
            if (a[i].fr == a[j].fr) ans += sec[a[i].sc] - 1;
            else if (a[i].sc == a[j].sc) ans += fir[a[i].fr] - 1;
        }
    }
    cout << ans / 2;
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 5 ms 560 KB Output is correct
12 Correct 273 ms 1372 KB Output is correct
13 Correct 625 ms 1620 KB Output is correct
14 Correct 97 ms 1884 KB Output is correct
15 Execution timed out 2054 ms 8596 KB Time limit exceeded
16 Halted 0 ms 0 KB -