var_a vs var_d
FLAGGEDProblem: two-sum
A→B55%B→A59%Shared fingerprints23
82tokens in the longest matched region
var_a
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int cnt; long long goal;
cin >> cnt >> goal;
unordered_map<long long, int> encountered;
encountered.reserve(cnt * 2);
for (int cursor = 1; cursor <= cnt; cursor++) {
long long val;
cin >> val;
auto found = encountered.find(goal - val);
if (found != encountered.end()) {
cout << found->second << ' ' << cursor << '\n';
return 0;
}
encountered[val] = cursor;
}
return 0;
}
var_d
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; long long t;
unordered_map<long long, int> seen;
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cin >> n >> t;
seen.reserve(n * 2);
for (int idx = 1; idx <= n; idx++) {
long long x;
cin >> x;
auto it = seen.find(t - x);
if (it != seen.end()) {
cout << it->second << ' ' << idx << '\n';
return 0;
}
seen[x] = idx;
}
return 0;
}