17172022-12-01 16:39:11AronCsodálatos Csillagképekcpp11Wrong answer 0/1001.097s14508 KiB
#include <iostream>
#include <vector>

using namespace std;
int main()
{
    long int N;
    cin >> N;

    vector<vector<int>> XY(N);
    int seged;
    for (int i = 0; i < N; i++){
        cin >> seged;
        XY[i].push_back(seged);
        cin >> seged;
        XY[i].push_back(seged);

        XY[i].push_back(0);
    }

    /*for(int i = 0; i < N; i++){
        cout << XY[i][0] << XY[i][1];
    }*/

    int GotIt = 0;
    vector<vector<int>> Confirmed;
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
            cout << XY[i][0] << ' ' << XY[j][0] << ' ' << XY[i][1] << ' ' << XY[i][0] << '\n';
            if((XY[i][0] == XY[j][0]) && (XY[i][1] != XY[j][1]))
                XY[i][2]++;
        }

        if(XY[i][2] != 0){
            for(int j = 0; j < N; j++){
            if((XY[i][1] == XY[j][1]) && (XY[i][0] != XY[j][0]))
                GotIt += XY[i][2];
            }
        }
    }

    cout << GotIt;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Wrong answer3ms1812 KiB
subtask20/25
2Wrong answer7ms2008 KiB
3Wrong answer12ms2256 KiB
4Wrong answer20ms2452 KiB
5Wrong answer20ms2660 KiB
subtask30/40
6Wrong answer472ms3016 KiB
7Wrong answer432ms3008 KiB
8Time limit exceeded1.039s3364 KiB
9Time limit exceeded1.034s2456 KiB
10Wrong answer904ms3560 KiB
11Time limit exceeded1.023s2600 KiB
subtask40/35
12Time limit exceeded1.044s5680 KiB
13Time limit exceeded1.016s13592 KiB
14Time limit exceeded1.013s7992 KiB
15Time limit exceeded1.055s8004 KiB
16Time limit exceeded1.011s9960 KiB
17Time limit exceeded1.08s11620 KiB
18Time limit exceeded1.097s5968 KiB
19Time limit exceeded1.049s12120 KiB
20Time limit exceeded1.014s13828 KiB
21Time limit exceeded1.085s14508 KiB