Submission #19291385

---

Source Code Expand

// #pragma GCC target("avx")  // CPU 処理並列化
// #pragma GCC optimize("O3")  // CPU 処理並列化
// #pragma GCC optimize("unroll-loops")  // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
// #define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);

#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
#include<numeric>
#include<unordered_set>
#include<unordered_map>
#include<complex>
using namespace std;
const long long mod=998244353;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const double EPS=1e-11;
const double INF=1e+10;
const double PI=acos(-1.0);
const int C_SIZE = 11100000;
const int UF_SIZE = 3100000;
namespace{
	long long fact[C_SIZE];
	long long finv[C_SIZE];
	long long inv[C_SIZE];
	inline long long Comb(int a,int b){
	 	if(a<b||b<0)return 0;
	 	return fact[a]*finv[b]%mod*finv[a-b]%mod;
	}
	void init_C(int n){
		fact[0]=finv[0]=inv[1]=1;
		for(int i=2;i<n;i++){
			inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
		}
		for(int i=1;i<n;i++){
			fact[i]=fact[i-1]*i%mod;
			finv[i]=finv[i-1]*inv[i]%mod;
		}
	}
	long long pw(long long a,long long b){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%mod;
			a=a*a%mod;
			b/=2;
		}
		return ret;
	}
	long long pw_mod(long long a,long long b,long long M){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%M;
			a=a*a%M;
			b/=2;
		}
		return ret;
	}
	int pw_mod_int(int a,int b,int M){
		if(a<0)return 0;
		if(b<0)return 0;
		int ret=1;
		while(b){
			if(b%2)ret=(long long)ret*a%M;
			a=(long long)a*a%M;
			b/=2;
		}
		return ret;
	}
	int ABS(int a){return max(a,-a);}
	long long ABS(long long a){return max(a,-a);}
	double ABS(double a){return max(a,-a);}
	int sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }
	int UF[UF_SIZE];
	void init_UF(int n){
		for(int i=0;i<n;i++)UF[i]=-1;
	}
	int FIND(int a){
		if(UF[a]<0)return a;
		return UF[a]=FIND(UF[a]);
	}
	void UNION(int a,int b){
		a=FIND(a);b=FIND(b);if(a==b)return;
		if(UF[a]>UF[b])swap(a,b);
		UF[a]+=UF[b];UF[b]=a;
	}
}
// ここから編集しろ
#include <atcoder/math>
using namespace atcoder;
int main(){
	int T;scanf("%d",&T);
	while(T--){
		long long a,b,c,d;
		scanf("%lld%lld%lld%lld",&a,&b,&c,&d);
      if(b==0){
        printf("%d\n",(d-a-1)/c);
        continue;
      }
		long long ret=0;
		long long JR=(d-1)/(c-b);
		long long N=(a+JR*b)/d+1;
		long long tmp=floor_sum(N,b,d,d-a)-floor_sum(N,c,d,d-a-1);
		ret=(d*N-a)/b-tmp;
      //printf("%d %d\n",JR,N);
		printf("%lld\n",ret);
	}
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:114:18: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=]
  114 |         printf("%d\n",(d-a-1)/c);
      |                 ~^    ~~~~~~~~~
      |                  |           |
      |                  int         long long int
      |                 %lld
./Main.cpp:109:13: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  109 |  int T;scanf("%d",&T);
      |        ~~~~~^~~~~~~~~
./Main.cpp:112:8: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  112 |   scanf("%lld%lld%lld%lld",&a,&b,&c,&d);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
./Main.cpp: At global scope:
./Main.cpp:99:7: warning: ‘void {anonymous}::UNION(int, int)’ defined but not used [-Wunused-function]
   99 |  void UNION(int a,int b){
      |       ^~~~~
./Main.cpp:92:7: warning: ‘void {anonymous}::init_UF(int)’ defined but not used [-Wunused-function]
   92 |  void init_UF(int n){
      |       ^~~~~~~
./Main.cpp:90:6: warning: ‘int {anonymous}::sig(double)’ defined but not used [-Wunused-function]
   90 |  int sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }
      |      ^~~
./Main.cpp:89:9: warning: ‘double {anonymous}::ABS(double)’ defined but not used [-Wunused-function]
   89 |  double ABS(double a){return max(a,-a);}
      |         ^~~
./Main.cpp:88:12: warning: ‘long long int {anonymous}::ABS(long long int)’ defined but not used [-Wunused-function]
   88 |  long long ABS(long long a){return max(a,-a);}
      |            ^~~
./Main.cpp:87:6: warning: ‘int {anonymous}::ABS(int)’ defined but not used [-Wunused-function]
   87 |  int ABS(int a){return max(a,-a);}
      |      ^~~
./Main.cpp:76:6: warning: ‘int {anonymous}::pw_mod_int(int, int, int)’ defined but not used [-Wunused-function]
   76 |  int pw_mod_int(i...

Judge Result