Submission #1119273

#TimeUsernameProblemLanguageResultExecution timeMemory
1119273HasanV11010238Table Tennis (info1cup20_tabletennis)C++17
0 / 100
55 ms3636 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define mod 1000000007 #define INF 1000000000000000000 int main(){ int n, k; cin>>n>>k; vector<ll> v(n + k, 0); for (int i = 0; i < n + k; i++){ cin>>v[i]; } vector<int> ti(n + k, 0); int timer = 0; for (int i = 0; i < k; i++){ for (int j = n + k - 1; j > max(n, i); j--){ timer++; int skp = i + n + k - j - 1, cnt = 0; ll su = v[i] + v[j]; int l = i , r = j; while (skp <= k && l < r && cnt < n){ if (v[l] + v[r] == su){ cnt += 2; ti[l] = ti[r] = timer; l++, r--; } else if (v[l] + v[r] > su){ skp++; r--; } else{ skp++; l++; } } if (cnt == n){ for (int l = 0; l < n + k; l++){ if (ti[l] == timer){ cout<<l + 1<<" "; } } return 0; } } } }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...