oj.uz

Submission #676196

# Submission time Handle Problem Language Result Execution time Memory
676196 2022-12-29T19:44:17 Z Toxtaq Star triangles (IZhO11_triangle) C++17
0 / 100
 2000 ms 4648 KB 
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin >> n;
    vector<int>x(n), y(n);
    map<int, int>X;
    for(int i = 0;i < n;++i){
        cin >> x[i] >> y[i];
        X[x[i]]++;
    }
    int result = 0;
    for(int i = 0;i < n;++i){
        for(int j = i + 1;j < n;++j){
            if(y[i] == y[j])result += X[x[i]] + X[x[j]] - 2;
        }
    }
    cout << result;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 6 ms 340 KB Output is correct
11 Correct 8 ms 340 KB Output is correct
12 Correct 43 ms 504 KB Output is correct
13 Correct 1260 ms 796 KB Output is correct
14 Correct 47 ms 924 KB Output is correct
15 Execution timed out 2067 ms 4648 KB Time limit exceeded
16 Halted 0 ms 0 KB -