oj.uz

Submission #91066

# Submission time Handle Problem Language Result Execution time Memory
91066 2018-12-26T06:22:19 Z quotitquot Star triangles (IZhO11_triangle) C++
0 / 100
 181 ms 11052 KB 
#include <bits/stdc++.h>
#define fr first
#define sc scanf
#define pf printf
#define se second
#define sq(x) x * x
#define ll long long
#define pb push_back
#define mk make_pair
#define ld long double
#define pr pair<ll,ll>
#define sz(s) int(s.size())
#define piip pair< pair<ll,ll>,ll >
//#define fin(s) freopen( s, "r", stdin )
//#define fout(s) freopen( s, "w", stdout )
#define TIME ios_base::sync_with_stdio(0)
using namespace std;

const ll INF = 1e9;
const ll N = 1e5 + 1;
const ll mod = 1e9 + 7;
const long double eps = 1E-7;

map<ll,ll>l, r;
ll n, x[N], y[N], ans;
int main()
{
    TIME;
    cin >> n;
    for( int i = 1; i <= n; i ++ )
    {
        cin >> x[i] >> y[i];
        l[x[i]] ++, r[y[i]] ++;
    }
    for( int i = 1; i <= n; i ++ )
        ans += (l[x[i]]-1) * (r[y[i]]-1);
    cout << ans << endl;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 456 KB Output is correct
3 Correct 2 ms 456 KB Output is correct
4 Correct 2 ms 456 KB Output is correct
5 Correct 2 ms 456 KB Output is correct
6 Correct 2 ms 480 KB Output is correct
7 Correct 2 ms 500 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 2 ms 564 KB Output is correct
10 Correct 2 ms 576 KB Output is correct
11 Correct 2 ms 624 KB Output is correct
12 Correct 9 ms 1540 KB Output is correct
13 Correct 8 ms 1688 KB Output is correct
14 Correct 13 ms 2408 KB Output is correct
15 Correct 181 ms 8768 KB Output is correct
16 Incorrect 103 ms 11052 KB Output isn't correct
17 Halted 0 ms 0 KB -