求助20wa

P3613 【深基15.例2】寄包柜

REAL_曼巴 @ 2021-04-21 19:23:22

#include<iostream>
using namespace std;

struct kk{
    long long u;
};
struct node{
    kk p;
};
node d[100001];
void opt1(){
    int a,b,c;
    cin>>a>>b>>c;
    d[a].p.u=c;
}
void opt2(){
    int a,b;
    cin>>a>>b;
    cout<<d[a].p.u<<endl;
}
int main(){
    int n,m;
    cin>>n>>m;
    while(m--){
        int o;
        cin>>o;
        if(o==1)opt1();
        if(o==2)opt2();
    }
    return 0;
}

by REAL_曼巴 @ 2021-04-21 19:25:32

记录

解决送关注,感激不尽


by JRzyh @ 2021-04-21 19:33:20

@无敌曼巴 您的b读进来有用吗(


by REAL_曼巴 @ 2021-04-21 19:34:20

@Zhaoyuhang2008 哦哦哦,谢谢


|