Submission #879061

#TimeUsernameProblemLanguageResultExecution timeMemory
8790618pete8Team Contest (JOI22_team)C++14
0 / 100
58 ms10844 KiB
#include<iostream> #include<stack> #include<map> #include<vector> #include<string> #include<unordered_map> #include <queue> #include<cstring> #include<limits.h> #include<cmath> #include<set> #include<algorithm> #include<bitset> using namespace std; #define ll long long #define f first #define endl "\n" #define s second #define pii pair<int,int> #define ppii pair<pii,int> #define vi vector<int> #define pb push_back //#define p push #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #define F(n) for(int i=0;i<n;i++) #define lb lower_bound #define ub upper_bound #define fastio ios::sync_with_stdio(false);cin.tie(NULL); #pragma GCC optimize ("03,unroll-lopps") using namespace std; #define int long long const int mod=9901,mxn=3*1e5+5,inf=1e18,lg=30,minf=-1e18; vector<pii>v[3]; vector<int>e[3]; int cnt[3]; bitset<mxn+10>del; int32_t main(){ fastio int n,a;cin>>n; for(int i=0;i<3;i++)e[i].resize(n),v[i].resize(n); for(int i=0;i<n;i++)for(int j=0;j<3;j++)cin>>e[j][i],v[j][i]={e[j][i],i}; for(int j=0;j<3;j++)sort(rall(v[j])); bool yes=false; while(cnt[0]<n&&cnt[1]<n&&cnt[2]<n){ yes=false; for(int i=0;i<3;i++){ while(cnt[i]<n&&del[v[i][cnt[i]].s])cnt[i]++; if(cnt[i]>=n){ cout<<-1; return 0; } } for(int i=0;i<3;i++)for(int j=0;j<3;j++)if(i!=j&&e[i][v[i][cnt[i]].s]==e[i][v[j][cnt[j]].s])del[v[i][cnt[i]].s]=yes=true; if(!yes){ cout<<v[0][cnt[0]].f+v[1][cnt[1]].f+v[2][cnt[2]].f; return 0; } } cout<<-1; }

Compilation message (stderr)

team.cpp:30:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   30 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
team.cpp:38:14: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   38 | int32_t main(){
      |              ^
team.cpp: In function 'int32_t main()':
team.cpp:40:8: warning: unused variable 'a' [-Wunused-variable]
   40 |  int n,a;cin>>n;
      |        ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...