Submission #956415

# Submission time Handle Problem Language Result Execution time Memory
956415 2024-04-01T19:09:07 Z MarwenElarbi Team Contest (JOI22_team) C++17
0 / 100
2 ms 348 KB
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define vi vector<int>
#define ve vector
#define ll long long
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define onbit __builtin_popcount
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e18
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll MOD = 1e9+7;
const int nax = 105;
const int MAX_VAL = 1e6+1;
double PI=3.14159265359;
int arx[8]={1,0,0,-1,-1,-1, 1, 1};
int ary[8]={0,1,-1, 0, 1,-1,-1, 1};
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main(){
    optimise;
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    //setIO("dec");
    int n;
    cin>>n;
    int x[n],y[n],z[n];
    set<ii> xr,yr,zr;
    for (int i = 0; i < n; ++i)
    {
        cin>>x[i]>>y[i]>>z[i];
        xr.insert({x[i],i});
        yr.insert({y[i],i});
        zr.insert({z[i],i});
    }
    int res=-1;
    while(!xr.empty()&&!yr.empty()&&!zr.empty()){
        int px=xr.rbegin()->se;
        int py=yr.rbegin()->se;
        int pz=zr.rbegin()->se;
        //cout <<px<<" "<<py<<" "<<pz<<endl;
        if(z[px]>=z[pz]||y[px]>=y[py]){
            xr.erase({x[px],px});
            yr.erase({y[px],px});
            zr.erase({z[px],px});
            continue;
        }
        if(z[py]>=z[pz]||x[py]>=x[px]){
            xr.erase({x[py],py});
            yr.erase({y[py],py});
            zr.erase({z[py],py});
            continue;
        }if(x[pz]>=x[px]||y[pz]>=y[py]){
            xr.erase({x[pz],pz});
            yr.erase({y[pz],pz});
            zr.erase({z[pz],pz});
            continue;
        }
        res=x[px]+y[py]+z[pz];
        break;
    }
    cout <<res<<endl;

}

Compilation message

team.cpp: In function 'void setIO(std::string)':
team.cpp:35:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
team.cpp:36:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
team.cpp: In function 'int main()':
team.cpp:42:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
team.cpp:43:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |         freopen("output.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -