#include<iostream>
#include<vector>
#include<queue>
#include<iomanip>
#include<cstdlib>
#include<cmath>
using namespace std;
vector<int> sameCylinderpos;//当前柱面号相同访问者
struct process {
  int id;//进程号
  int cylinder;//柱面号
  int track;//盘面号
  int sector;//扇区号
  process(int _id = 0, int _cylinder = 0, int _track = 0, int _sector = 0) {
    id = _id;
    cylinder = _cylinder;
    track = _track;
    sector = _sector;
  }
  void print() {//输出
    cout << "Process id:" <<setw(5)<< id;
    cout << " Cylinder id:" << setw(5)<<cylinder ;
    cout << " Track id:" << setw(5)<<track;
    cout << " Sector id:" << setw(5)<<sector;
    cout << endl;
  }
};
bool direction;//0 up,1out 
int curCylinder;//当前柱面号
int curSector;//当前扇区号
vector<process> iorequests;//请求I/O表
void init() {//初始化
  direction = 0;
  curCylinder = 0;
  curSector = 0;
}
void driveScheduling() {//驱动调度
  if (iorequests.empty()) {//当前有无等待访问者
    cout << "\nNo requests!\n";
    return;
  }
  else {
    cout << "\n*****************************************\n";
    for (int i = 0; i < iorequests.size(); i++)
      iorequests[i].print();
    cout << "\n*****************************************\n";
    bool sameCylinder = 0;//有无与当前柱面号相同访问者
    bool greaterCylinder = 0;//有无大于当前柱面号访问者
    bool lesserCylinder = 0;//有无小于当前柱面号访问者
    sameCylinderpos.clear();
    int mingtCylinderpos=-1;//大于当前柱面号的最小者
    int maxltCylinderpos=-1;//小于当前柱面号的最大者
    int iorequestPos=0;//位置
    for (int i = 0; i < iorequests.size(); i++) {//判断有无与当前柱面号相同访问者，比当前大的请求、比当前小的请求
      if (iorequests[i].cylinder == curCylinder) {
        sameCylinder = 1;
        sameCylinderpos.push_back(i);//与当前柱面号相同的访问者，放入可变长数组中暂存
      }
      if (iorequests[i].cylinder > curCylinder) {//从大于当前柱面号请求中选一个最小者
        greaterCylinder = 1;
        if (mingtCylinderpos == -1)
          mingtCylinderpos = i;
        if (iorequests[i].cylinder < iorequests[mingtCylinderpos].cylinder) 
          mingtCylinderpos = i;
      }
      if (iorequests[i].cylinder < curCylinder) {//从小于当前柱面号请求中选一个最大者
        lesserCylinder = 1;
        if (maxltCylinderpos == -1)
          maxltCylinderpos = i;
        if (iorequests[i].cylinder > iorequests[maxltCylinderpos].cylinder)
          maxltCylinderpos = i;
      }
    }
    if (sameCylinder == 1) {//选使得旋转距离最短的访问者
      int rotateDist = 20;
      iorequestPos = sameCylinderpos[0];
      for (int i=0;i<sameCylinderpos.size();i++) {
        int pos = sameCylinderpos[i];
        int& x = iorequests[pos].sector;
        int& y = curSector;
        int dist = ((x+8-y)%8);
        if (dist < rotateDist) {//选择能使旋转距离最短的访问者
          rotateDist = dist;
          iorequestPos = pos;
        }
      }
    }
    else {
      if (direction == 0) {
        if (greaterCylinder)
          iorequestPos = mingtCylinderpos;
        else {
          direction = 1;//置移臂方向
          iorequestPos = maxltCylinderpos;
        }
      }
      else {
        if (lesserCylinder)
          iorequestPos = maxltCylinderpos;
        else {
          direction = 0;//置移臂方向为往里
          iorequestPos = mingtCylinderpos;
        }
      }
    }
    curCylinder = iorequests[iorequestPos].cylinder;
    curSector = iorequests[iorequestPos].sector;
    cout << "\n*****************************************\n";
    iorequests[iorequestPos].print();
    cout << "Current Cylinder:" << curCylinder << endl;
    cout << "Current Sector:" << curSector << endl;
    cout << "Current direction:";
    if (direction == 0)
      cout << "up!" << endl;
    else
      cout << "down!" << endl;
    cout << "\n*****************************************\n";
    iorequests.erase(iorequests.begin() + iorequestPos);
  }
}
void acceptRequest() {
  cout << "\nAccepting requests!";
  cout << "\ninput request num:";
  int n;
  cin >> n;
  if (n == 0) {//不发送请求
    cout << "No requests!";
    return;
  }
  else while(n--) {
    cout << "input process id,cylinder,track,sector";
    int id, cylinder, track, sector;
    cin >> id >> cylinder >> track >> sector;
    process newp(id, cylinder, track, sector);
    iorequests.push_back(newp);
  }
}
void cpuwork() {
  srand(time(NULL));
  while (1) {
    cout << "1. Drive scheduling 2.Accept Requests";
    double opnum= rand() / double(RAND_MAX);
    if (opnum > 0.5) 
      driveScheduling();
    else
      acceptRequest();
    cout << "Continue?Y/N";
    char op;
    cin >> op;
    if (op == 'Y');
    else
      break;
  }
}
int main() {
  init();
  cpuwork();
}