제출 #1004467

#제출 시각아이디문제언어결과실행 시간메모리
1004467vjudge1말 (IOI15_horses)C++17
17 / 100
1593 ms8260 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define f first #define s second #define pb push_back #define pf push_front #define pi pair<int,int> #define vi vector<int> int n ; vi x, y; const int mod = 1e9+7; ll init(int N, int X[], int Y[]){ n = N; x.resize(N); y.resize(N); for(int i =0; i < n; i++){ x[i] =X[i]; y[i] = Y[i]; } ll final = 0; ll ans = 0; ll have = 1; ll cnt = 0, left = 0; ll prev =1; ll ccnt = 0, cleft= 0, cl=0; for(int i = 1; i <= n; i++){ cl = 0; have = ((have* x[i-1])); while(have>=mod){ ccnt++; have %=mod; } while(y[i-1]>=mod){ cl++; y[i-1]%=mod; } ll hold = have*y[i-1]; if(hold >=mod){ ccnt++; } if(ccnt> cnt){ cnt = ccnt+cl; left = hold; } else if(ccnt==cnt && hold> left){ cnt = ccnt+cl; left = hold; } } return left; } ll updateX(int pos, int val){ x[pos]=val; ll final = 0; ll ans = 0; ll have = 1; ll cnt = 0, left = 0; ll prev =1; ll ccnt = 0, cleft= 0, cl=0; for(int i = 1; i <= n; i++){ cl = 0; have = ((have* x[i-1])); while(have>=mod){ ccnt++; have %=mod; } while(y[i-1]>=mod){ cl++; y[i-1]%=mod; } ll hold = have*y[i-1]; if(hold >=mod){ ccnt++; } if(ccnt> cnt){ cnt = ccnt+cl; left = hold; } else if(ccnt==cnt && hold> left){ cnt = ccnt+cl; left = hold; } } return left; } ll updateY(int pos, int val){ y[pos]=val; ll final = 0; ll ans = 0; ll have = 1; ll cnt = 0, left = 0; ll prev =1; ll ccnt = 0, cleft= 0, cl=0; for(int i = 1; i <= n; i++){ cl = 0; have = ((have* x[i-1])); while(have>=mod){ ccnt++; have %=mod; } while(y[i-1]>=mod){ cl++; y[i-1]%=mod; } ll hold = have*y[i-1]; if(hold >=mod){ ccnt++; } if(ccnt> cnt){ cnt = ccnt+cl; left = hold; } else if(ccnt==cnt && hold> left){ cnt = ccnt+cl; left = hold; } } return left; }

컴파일 시 표준 에러 (stderr) 메시지

horses.cpp: In function 'long long int init(int, int*, int*)':
horses.cpp:25:8: warning: unused variable 'final' [-Wunused-variable]
   25 |     ll final = 0;
      |        ^~~~~
horses.cpp:28:8: warning: unused variable 'ans' [-Wunused-variable]
   28 |     ll ans = 0;
      |        ^~~
horses.cpp:31:8: warning: unused variable 'prev' [-Wunused-variable]
   31 |     ll prev =1;
      |        ^~~~
horses.cpp:32:18: warning: unused variable 'cleft' [-Wunused-variable]
   32 |     ll ccnt = 0, cleft= 0, cl=0;
      |                  ^~~~~
horses.cpp: In function 'long long int updateX(int, int)':
horses.cpp:71:8: warning: unused variable 'final' [-Wunused-variable]
   71 |     ll final = 0;
      |        ^~~~~
horses.cpp:74:8: warning: unused variable 'ans' [-Wunused-variable]
   74 |     ll ans = 0;
      |        ^~~
horses.cpp:77:8: warning: unused variable 'prev' [-Wunused-variable]
   77 |     ll prev =1;
      |        ^~~~
horses.cpp:78:18: warning: unused variable 'cleft' [-Wunused-variable]
   78 |     ll ccnt = 0, cleft= 0, cl=0;
      |                  ^~~~~
horses.cpp: In function 'long long int updateY(int, int)':
horses.cpp:114:8: warning: unused variable 'final' [-Wunused-variable]
  114 |     ll final = 0;
      |        ^~~~~
horses.cpp:117:8: warning: unused variable 'ans' [-Wunused-variable]
  117 |     ll ans = 0;
      |        ^~~
horses.cpp:120:8: warning: unused variable 'prev' [-Wunused-variable]
  120 |     ll prev =1;
      |        ^~~~
horses.cpp:121:18: warning: unused variable 'cleft' [-Wunused-variable]
  121 |     ll ccnt = 0, cleft= 0, cl=0;
      |                  ^~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...