Submission #1272372

#	Time	Username	Problem	Language	Result	Execution time	Memory
1272372		lioow	Med (COCI22_med)	C++20	50 / 50	2 ms	580 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define int long long
#define repp(i,x,n) for(int i=x;i<=n;i++)
#define rep(i,x,n) for(int i=x;i>=n;i--)
#define r0 return 0
#define fi first
#define se second
#define liow ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define jelek cout<<"jelek"<<endl
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define tp tuple<int,int,int>
#define fl fflush(stdout)
#define ld long double
#define p5 pair<int,pair<pair<int,int>,pair<int,int>>>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")  
#define pil pair<int,int>
#define p3 pair<int,pii>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<pair<int,int>, null_type,  less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
//const int mod=1e9+7;
const int SQMAX=635,INF=1e18;
const int mod=998244353;
//const int MOD=1e6+3;
mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
pii dr[8]={{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1}};
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int dxx[4]={1,1,-1,-1};
int dyy[4]={1,-1,-1,1};
int mul(int x,int y){return (x%mod*y%mod)%mod;}
int expo(int b,int e){
  if(e==0) return 1;
  int tmp=expo(b,e/2);
  if(e%2) return mul(tmp,mul(tmp,b));
  else return mul(tmp,tmp);
}
const int maxn=200005;
const int N=1e5;

bool comp(pair<int,pair<string,int>>x,pair<int,pair<string,int>>y){
	if(x.fi!=y.fi) return x.fi>y.fi;
	else x.se.fi<y.se.fi;
}
bool sam(string s,string t){
	int x=min(s.length(),t.length());
	repp(i,0,x-1){
		if(s[i]!=t[i]) return s[i]<t[i];
	}
	return s.length()<t.length();
}

void solve(){
	int n;cin>>n;
	vector<pair<int,string>>v;
	int skor[n+2];
	string nama[n+2];
	repp(i,1,n){
		string s;cin>>s;
		skor[i]=0;
		repp(j,1,5){
			int x;cin>>x;
			skor[i]+=x;
		}
		nama[i]=s;
		v.pb({-skor[i],s});
	}	
	sort(all(v));
	repp(i,1,n){
		cout<<lower_bound(all(v),make_pair(-skor[i]-500,nama[i]))-v.begin()+1<<" ";
		cout<<lower_bound(all(v),make_pair(-skor[i]+500,nama[i]))-v.begin()<<endl;
	}
}

signed main(){
  liow;
  int t=1;
 // cin>>t;
  while(t--){
    solve();
  }
}

Compilation message (stderr)

Main.cpp: In function 'bool comp(std::pair<long long int, std::pair<std::__cxx11::basic_string<char>, long long int> >, std::pair<long long int, std::pair<std::__cxx11::basic_string<char>, long long int> >)':
Main.cpp:48:21: warning: ignoring return value of 'constexpr bool std::operator<(strong_ordering, __cmp_cat::__unspec)', declared with attribute 'nodiscard' [-Wunused-result]
   48 |         else x.se.fi<y.se.fi;
      |                     ^
In file included from /usr/include/c++/13/bits/stl_pair.h:65,
                 from /usr/include/c++/13/bits/stl_algobase.h:64,
                 from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from Main.cpp:1:
/usr/include/c++/13/compare:292:5: note: declared here
  292 |     operator< (strong_ordering __v, __cmp_cat::__unspec) noexcept
      |     ^~~~~~~~
Main.cpp:48:21: warning: control reaches end of non-void function [-Wreturn-type]
   48 |         else x.se.fi<y.se.fi;
      |                     ^

• Subtask 1: 10 / 10
• Subtask 2: 40 / 40