oj.uz

Submission #671482

# Submission time Handle Problem Language Result Execution time Memory
671482 2022-12-13T05:52:09 Z Alihan_8 Star triangles (IZhO11_triangle) C++17
100 / 100
 436 ms 26440 KB 
#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n; cin >> n;
    vector <int> x(n), y(n);
    map <int,vector<int>> mpx, mpy;
    for ( int i = 0; i < n; i++ ){
        cin >> x[i] >> y[i];
        mpx[y[i]].pb(x[i]);
        mpy[x[i]].pb(y[i]);
    }
    int cnt = 0;
    for ( int i = 0; i < n; i++ ){
        int l = x[i], r = y[i];
        cnt += ((int)mpx[r].size()-1)*((int)mpy[l].size()-1);
    }
    cout << cnt;

    cout << '\n';
}

Compilation message

triangle.cpp: In function 'void IO(std::string)':
triangle.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
triangle.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.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 1 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 0 ms 320 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 8 ms 1748 KB Output is correct
13 Correct 7 ms 1792 KB Output is correct
14 Correct 12 ms 2588 KB Output is correct
15 Correct 141 ms 12236 KB Output is correct
16 Correct 143 ms 12912 KB Output is correct
17 Correct 135 ms 12412 KB Output is correct
18 Correct 138 ms 12316 KB Output is correct
19 Correct 420 ms 24924 KB Output is correct
20 Correct 289 ms 19376 KB Output is correct
21 Correct 436 ms 26440 KB Output is correct
22 Correct 435 ms 26400 KB Output is correct