Submission #445029

#TimeUsernameProblemLanguageResultExecution timeMemory
445029Tahmid690Jarvis (COCI19_jarvis)C++17
0 / 70
77 ms6584 KiB
// "Say:He is the Most Merciful,We have believed in him and upon him we have relied" [67:29] //#pragma GCC optimize ("Ofast") //#pragma GCC target ("avx2") //#pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> using namespace std; /* #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; */ typedef long long ll; typedef long double ld; typedef pair<ll,ll> pll; typedef pair<int,int> pii; typedef vector<ll> vll; typedef vector<int> vii; typedef map<int,int> mpi; typedef map<ll,ll> mpl; typedef unordered_map<int,int> umpi; typedef unordered_map<ll,ll> umpl; #define ump unordered_map #define mod 1000000007 #define inf 1000000000000000006 #define infi 1000000009 #define ff first #define ss second #define pb push_back #define all(v) v.begin(), v.end() #define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define endl '\n' #define pi acos(-1.0) #define dec(n) fixed << setprecision(n) #define N 200005 //#define int long long ll n,a,b,mx; mpl mp; void solve(){ cin >> n; while(n--){ cin >> a >> b; mp[a-b]++; mx=max(mx,mp[a-b]); } cout << mx << endl; } signed main(){ fastio; //srand(chrono::steady_clock::now().time_since_epoch().count()); int T=1,cs=0; //cin >> T; while(T--){ //cout << "Case " << ++cs << ":" << " " ; solve(); } }

Compilation message (stderr)

jarvis.cpp: In function 'int main()':
jarvis.cpp:59:13: warning: unused variable 'cs' [-Wunused-variable]
   59 |     int T=1,cs=0;
      |             ^~
#Verdict Execution timeMemoryGrader output
Fetching results...