oj.uz

답안 #1004474

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1004474 2024-06-21T09:17:33 Z vjudge1 말 (IOI15_horses) C++17
17 / 100
 1500 ms 8280 KB 
#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 have = 1;
    ll cnt = 0, left = 0, 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+cl> cnt){
            cnt = ccnt+cl;
            left = hold;
        }
        else if(ccnt+cl==cnt && hold> left){
            cnt = ccnt+cl;
            left = hold;
        }
      
        
         
   }
   return left;

}


ll updateX(int pos, int val){
    
    x[pos]=val;
    
    ll final = 0;
    
  
    ll have = 1;
    ll cnt = 0, left = 0, 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+cl> cnt){
            cnt = ccnt+cl;
            left = hold;
        }
        else if(ccnt+cl==cnt && hold> left){
            cnt = ccnt+cl;
            left = hold;
        }
      
        
         
   }
   return left;
}

ll updateY(int pos, int val){
     y[pos]=val;
  
   
    
  
    ll final = 0;
    
  
    ll have = 1;
    ll cnt = 0, left = 0, 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+cl> cnt){
            cnt = ccnt+cl;
            left = hold;
        }
        else if(ccnt+cl==cnt && hold> left){
            cnt = ccnt+cl;
            left = hold;
        }
      
        
         
   }
   return left;
}

Compilation message

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:29:27: warning: unused variable 'prev' [-Wunused-variable]
   29 |     ll cnt = 0, left = 0, prev =1;
      |                           ^~~~
horses.cpp:30:18: warning: unused variable 'cleft' [-Wunused-variable]
   30 |     ll ccnt = 0, cleft= 0, cl=0;
      |                  ^~~~~
horses.cpp: In function 'long long int updateX(int, int)':
horses.cpp:69:8: warning: unused variable 'final' [-Wunused-variable]
   69 |     ll final = 0;
      |        ^~~~~
horses.cpp:73:27: warning: unused variable 'prev' [-Wunused-variable]
   73 |     ll cnt = 0, left = 0, prev =1;
      |                           ^~~~
horses.cpp:74:18: warning: unused variable 'cleft' [-Wunused-variable]
   74 |     ll ccnt = 0, cleft= 0, cl=0;
      |                  ^~~~~
horses.cpp: In function 'long long int updateY(int, int)':
horses.cpp:113:8: warning: unused variable 'final' [-Wunused-variable]
  113 |     ll final = 0;
      |        ^~~~~
horses.cpp:117:27: warning: unused variable 'prev' [-Wunused-variable]
  117 |     ll cnt = 0, left = 0, prev =1;
      |                           ^~~~
horses.cpp:118:18: warning: unused variable 'cleft' [-Wunused-variable]
  118 |     ll ccnt = 0, cleft= 0, cl=0;
      |                  ^~~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Incorrect 0 ms 348 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1559 ms 8280 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Incorrect 0 ms 348 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Incorrect 0 ms 348 KB Output isn't correct
22 Halted 0 ms 0 KB -