ccf 202006-2 稀疏向量 python满分代码

ccf 202006-2 稀疏向量 python满分代码

参考链接：https://blog.csdn.net/weixin_41480156/article/details/107701647
9.13更新：好奇怪，第一种之前提交还是满分，这两天再试又运行超时了，不知道哪里出了问题。

import sys


def input2num():
    return map(int, input().split())


dim, cap_a, cap_b = input2num()
a = {}
tol = 0

for line in sys.stdin.readlines():
    i, n = map(int, line.split())
    if cap_a > 0:
        a[i] = n
        cap_a -= 1
    else:
        if i in a:
            tol += n * a[i]

print(tol)

第二种方法在评论区：https://blog.csdn.net/weixin_41480156/article/details/107701647
python满分代码，靠谱！

import sys
n, a, b = tuple(map(int,input().split()))
vector = list(map(int,sys.stdin.read().split()))
i = 0
j = 0
s = 0
while i<a and j<b:
    if vector[i*2] == vector[(a+j)*2]:
        s += vector[i*2+1]*vector[(a+j)*2+1]
        i+=1
        j+=1
    elif vector[i*2] < vector[(a+j)*2]:
        i+=1
    else:
        j+=1
print(s)

附上C++满分代码：https://blog.csdn.net/wingrez/article/details/107588745

#include<cstdio>
#include<vector>
using namespace std;

int n;
int a, b;
long long ans; // 使用 long long  

vector<pair<int, int> > u, v;

int main() {
	scanf("%d%d%d", &n, &a, &b);
	int id, val;
	for(int i=0; i<a; i++) {
		scanf("%d%d", &id, &val);
		u.push_back({id, val});
	}
	
	for(int i=0; i<b; i++) {
		scanf("%d%d", &id, &val);
		v.push_back({id, val});
	}
	
	int i=0, j=0;
	while(i<a && j<b){
		if(u[i].first==v[j].first){
			ans += u[i].second * v[j].second;
			i++; j++;
		}
		else if(u[i].first>v[j].first){
			j++;
		}
		else{
			i++;
		}
	}

	printf("%lld\n", ans);

	return 0;
}