青岛网络赛J-Press the button【暴力】

Press the Button

---

Time Limit: 1 Second      Memory Limit: 131072 KB

---

BaoBao and DreamGrid are playing a game using a strange button. This button is attached to an LED light (the light is initially off), a counter and a timer and functions as follows:

• When the button is pressed, the timer is set to  seconds (no matter what the value of the timer is before the button is pressed), where  is a given integer, and starts counting down;

• When the button is pressed with the LED light off, the LED light will be lit up;

• When the button is pressed with the LED light on, the value of the counter will be increased by 1;

• When the timer counts down to 0, the LED light turns off.

During the game, BaoBao and DreamGrid will press the button periodically. If the current real time (that is to say, the time elapsed after the game starts, NOT the value of the timer) in seconds is an integer and is a multiple of a given integer , BaoBao will immediately press the button  times; If the current time in seconds is an integer and is a multiple of another given integer , DreamGrid will immediately press the button  times.

Note that

• 0 is a multiple of every integer;

• Both BaoBao and DreamGrid are good at pressing the button, so it takes no time for them to finish pressing;

• If BaoBao and DreamGrid are scheduled to press the button at the same second, DreamGrid will begin pressing the button  times after BaoBao finishes pressing the button  times.

The game starts at 0 second and ends after  seconds (if the button will be pressed at  seconds, the game will end after the button is pressed). What's the value of the counter when the game ends?

Input

There are multiple test cases. The first line of the input contains an integer  (about 100), indicating the number of test cases. For each test case:

The first and only line contains six integers , , , ,  and  (, ). Their meanings are described above.

Output

For each test case output one line containing one integer, indicating the value of the counter when the game ends.

Sample Input

2
8 2 5 1 2 18
10 2 5 1 2 10

Sample Output

6
4

Hint

We now explain the first sample test case.

• At 0 second, the LED light is initially off. After BaoBao presses the button 2 times, the LED light turns on and the value of the counter changes to 1. The value of the timer is also set to 2.5 seconds. After DreamGrid presses the button 1 time, the value of the counter changes to 2.

• At 2.5 seconds, the timer counts down to 0 and the LED light is off.

• At 5 seconds, after DreamGrid presses the button 1 time, the LED light is on, and the value of the timer is set to 2.5 seconds.

• At 7.5 seconds, the timer counts down to 0 and the LED light is off.

• At 8 seconds, after BaoBao presses the button 2 times, the LED light is on, the value of the counter changes to 3, and the value of the timer is set to 2.5 seconds.

• At 10 seconds, after DreamGrid presses the button 1 time, the value of the counter changes to 4, and the value of the timer is changed from 0.5 seconds to 2.5 seconds.

• At 12.5 seconds, the timer counts down to 0 and the LED light is off.

• At 15 seconds, after DreamGrid presses the button 1 time, the LED light is on, and the value of the timer is set to 2.5 seconds.

• At 16 seconds, after BaoBao presses the button 2 times, the value of the counter changes to 6, and the value of the timer is changed from 1.5 seconds to 2.5 seconds.

• At 18 seconds, the game ends.

---

Author: JIN, Mengge
Source: The 2018 ACM-ICPC Asia Qingdao Regional Contest, Online

题意：

两个人按灯 第一个人在a的倍数时按b次 第二个人在c的倍数时按d次

如果灯在按时是暗的 则灯会被点亮 并开始倒计时 经过v+0.5秒后灯灭

如果灯在按时是亮的 则每按一次计数器加一 并且倒计时器刷新

问在t时 计数器的值

思路：

比赛的时候想的是 按的总次数是确定的好算的 现在只需要知道有多少个按灯时间之间间隔大于v

这些灯是暗的 需要浪费一次来点亮灯

czc当时提出了用lcm求一个周期的 但是怕时间不够 如果a和c是互质的 lcm可能还是会非常大 优化效果无法估计

trader比赛的时候推了半天的数论还是不行

最后比赛结束看了题解发现竟然真的就是lcm周期暴力来求

下次想这种真的搞不出的情况下 暴力就暴力试一发

先求一个周期里的按灯次数 存入vector 同时求取模后的余数的按灯次数

对vector排序 求得一个周期内用来亮灯的次数

再对周期的最后一个数和lcm进行特判

乘以相应的倍数即可

 #include <iostream>
 #include <algorithm>
 #include <stdio.h>
 #include <vector>
 #include <cmath>
 #include <cstring>
 #include <set>
 #include <map>

 using namespace std;

 typedef long long LL;

 int T;
 LL a, b, c, d, v, t;
 vector<LL>press;

 LL gcd(LL a, LL b)
 {
     if(b == ){
         return a;
     }
     else{
         return gcd(b, a % b);
     }
 }

 LL LCM(LL a, LL b)
 {
     return a * b / gcd(a, b);
 }

 int main()
 {
     cin>>T;
     while(T--){
         press.clear();
         scanf("%lld%lld%lld%lld%lld%lld", &a, &b, &c, &d, &v, &t);
         LL lcm = LCM(a, c);

         LL ans = , res = t % lcm, tmp = ;
         for(int i = ; i * a < lcm; i++){
             if(i * a <= res){
                 ans += b;
             }
             tmp += b;
             press.push_back(a * i);
         }
         for(int i = ; i * c < lcm; i++){
             if(i * c <= res){
                 ans += d;
             }
             tmp += d;
             press.push_back(c * i);
         }
         sort(press.begin(), press.end());

         for(int i = ; i < press.size(); i++){
             if(press[i] - press[i - ] > v){
                 tmp--;
                 if(press[i] <= res){
                     ans--;
                 }
             }
         }
         ans += tmp * (t / lcm);
         if(lcm - press[press.size() - ] > v){
             ans -= (t / lcm);
         }
         ans--;

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