ccf题解

#include <iostream>
using namespace std;
struct ip
{
    int time;
    int state;      // 1:未分配 2:待分配 3:占用 4:过期
    string name;
} ip[10001];

long long int time,go_time,seq,tdef,tmin,tmax;

long long int search()
{
	if (time == 0) go_time = seq + tdef;
    else if (tmin <= time - seq && time - seq <= tmax) go_time = time;
    else if (time - seq < tmin) go_time = seq + tmin;
    else if (time - seq > tmax) go_time = seq + tmax;
    return(go_time); 
}


int main()
{
    int n;
    string host;
    cin >> n >> tdef >> tmax >> tmin >> host;

    for (int i = 1; i <= n; i++) ip[i].state = 1;

    int n2;
    cin>>n2;
    for (int k = 1; k <= n2; k++) {
        string shost, get, type;
        int ip2;
        cin >> seq >> shost >> get >> type >> ip2 >> time;

        for (int i = 1; i <= n; i++) 
		{
            if (ip[i].state == 2 && ip[i].time <= seq) 
			{
                ip[i].state = 1;
                ip[i].name = "";
                ip[i].time = 0;
            } else if (ip[i].state == 3 && ip[i].time <= seq) 
			{
                ip[i].state = 4;
                ip[i].time = 0;
            }
        }

            if (get != host && get != "*" && type != "REQ")  continue;
            if (type != "DIS" && type != "REQ") continue;
            if ((get == "*" && type != "DIS") || (get == host && type=="DIS")) continue;
            if (type == "DIS")
			  {
                int select = -1;
                for (int i = 1; i <= n; i++)
				    if (ip[i].name == shost)
					 {
                        select = i;
                        break;
                    }
                   
                    for (int i = 1; i <= n; i++)
                        if (select==-1&&ip[i].state == 1) 
						{
                            select = i;
                            break;
                        }
                   
                   
                    for (int i = 1; i <= n; i++)
                        if (select==-1&&ip[i].state == 4)
						 {
                            select = i;
                            break;
                        }//这三个不能写到一个循环里面 
             
                if (select == -1)  continue;
				else 
				{
                    ip[select].state = 2;
                    ip[select].name = shost;
                    ip[select].time=search();
                    cout << host << " " << shost << " OFR " << " "<<select << " " << ip[select].time<<endl;
                }
            }
			  if (type == "REQ") 
			{
                if (get != host)
				 {
                    for (int i = 1; i <= n; i++)
                    {
					    if (ip[i].name == shost && ip[i].state == 2) 
						{
                            ip[i].state = 1;
                            ip[i].name = "";
                            ip[i].time = 0;
                            break;
                        }
                    }
                    continue;
                 } 
	
                if (ip2>n ||ip[ip2].name != shost)
				{
					cout << host << " " << shost <<" "<< " NAK " << ip2 << " 0" << endl;
                    
                } 
				else
                    {
					ip[ip2].state = 3;
                    ip[ip2].time = search();
                    cout << host << " " << shost <<" "<< " ACK " << ip2 << " " << ip[ip2].time << endl;
                    }
            }
        
      }
   
    return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值