oj.uz

답안 #915522

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
915522 2024-01-24T06:07:28 Z vjudge1 Bomb (IZhO17_bomb) C++17
8 / 100
 3 ms 600 KB 
/*#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")*/
#include <bits/stdc++.h>
#include <iomanip>
#define ll long long
#define int long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define str string
#define pii pair<int,int>
#define sz(x) x.size()
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define mii map<int,int>
#define mll map<ll,ll>
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define yess cout<<"Yes\n";
#define noo cout<<"No\n";
using namespace std;

void solve(){
    int n,m;
    cin>>n>>m;
    if(n==1){
        str s;
        cin>>s;
        vector<int >v;
        int k=0;
        for(int i=0;i<m;i++){
            if(s[i]=='1')k++;
            else{
                if(k>0){
                    v.pb(k);
                    k=0;
                }
            }
        }
        if(k>0){
            v.pb(k);
        }
        int ans=1;
        if(v.size()==0){
            cout<<0;
            return;
        }
        for(int i=2;i<=m;i++){
            k=1;
            for(int j=0;j<v.size();j++){
                if(v[j]<i){
                    k=0;
                    break;
                }
            }
            if(k==1){
                ans=i;
            }
        }
        cout<<ans;
    }
    else if(m==1){
        char s;
        vector<int >v;
        int k=0;
        for(int i=0;i<n;i++){
            cin>>s;
            if(s=='1')k++;
            else{
                if(k>0){
                    v.pb(k);
                    k=0;
                }
            }
        }
        if(k>0){
            v.pb(k);
        }
        int ans=1;
        if(v.size()==0){
            cout<<0;
            return;
        }
        for(int i=2;i<=n;i++){
            k=1;
            for(int j=0;j<v.size();j++){
                if(v[j]<i){
                    k=0;
                    break;
                }
            }
            if(k==1){
                ans=i;
            }
        }
        cout<<ans;
    }
    else{
        cout<<3;
    }
}

signed main(){
	//ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	//srand( time(0));
	//rand()
	//freopen("sum.in", "r", stdin);
	//freopen("sum.out", "w", stdout);
    int tests=1;
    //cin>>tests;
    for(int i=1;i<=tests;i++){
		//cout<<"TEST CASE : "<<i<<"\n";
		solve();
	}
}

Compilation message

bomb.cpp: In function 'void solve()':
bomb.cpp:54:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |             for(int j=0;j<v.size();j++){
      |                         ~^~~~~~~~~
bomb.cpp:90:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |             for(int j=0;j<v.size();j++){
      |                         ~^~~~~~~~~

Subtask #1
8.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 1 ms 348 KB Output isn't correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Incorrect 1 ms 348 KB Output isn't correct
10 Incorrect 0 ms 344 KB Output isn't correct
11 Incorrect 0 ms 344 KB Output isn't correct
12 Incorrect 0 ms 348 KB Output isn't correct
13 Correct 1 ms 348 KB Output is correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Incorrect 0 ms 348 KB Output isn't correct
16 Incorrect 0 ms 348 KB Output isn't correct
17 Incorrect 0 ms 348 KB Output isn't correct
18 Incorrect 0 ms 348 KB Output isn't correct
19 Incorrect 1 ms 348 KB Output isn't correct
20 Incorrect 1 ms 348 KB Output isn't correct
21 Incorrect 1 ms 348 KB Output isn't correct
22 Incorrect 0 ms 348 KB Output isn't correct
23 Incorrect 1 ms 348 KB Output isn't correct
24 Incorrect 0 ms 348 KB Output isn't correct
25 Incorrect 0 ms 348 KB Output isn't correct
26 Incorrect 1 ms 348 KB Output isn't correct
27 Correct 1 ms 348 KB Output is correct
28 Incorrect 1 ms 344 KB Output isn't correct
29 Incorrect 1 ms 348 KB Output isn't correct
30 Incorrect 0 ms 348 KB Output isn't correct
31 Incorrect 1 ms 348 KB Output isn't correct
32 Incorrect 0 ms 348 KB Output isn't correct
33 Incorrect 0 ms 348 KB Output isn't correct
34 Incorrect 1 ms 348 KB Output isn't correct
35 Incorrect 0 ms 344 KB Output isn't correct
36 Incorrect 1 ms 344 KB Output isn't correct
37 Incorrect 1 ms 348 KB Output isn't correct
38 Incorrect 0 ms 348 KB Output isn't correct
39 Incorrect 0 ms 348 KB Output isn't correct
40 Incorrect 0 ms 344 KB Output isn't correct
41 Incorrect 0 ms 344 KB Output isn't correct
42 Incorrect 0 ms 348 KB Output isn't correct
43 Incorrect 0 ms 348 KB Output isn't correct
44 Incorrect 0 ms 348 KB Output isn't correct
45 Incorrect 0 ms 348 KB Output isn't correct
46 Incorrect 0 ms 348 KB Output isn't correct
47 Incorrect 0 ms 348 KB Output isn't correct
48 Incorrect 0 ms 348 KB Output isn't correct
49 Incorrect 0 ms 348 KB Output isn't correct
50 Incorrect 1 ms 344 KB Output isn't correct
51 Incorrect 1 ms 348 KB Output isn't correct
52 Incorrect 0 ms 344 KB Output isn't correct
53 Incorrect 1 ms 344 KB Output isn't correct
54 Incorrect 0 ms 348 KB Output isn't correct
55 Incorrect 0 ms 348 KB Output isn't correct
56 Incorrect 1 ms 344 KB Output isn't correct
57 Incorrect 0 ms 348 KB Output isn't correct
58 Incorrect 0 ms 348 KB Output isn't correct
59 Incorrect 0 ms 348 KB Output isn't correct
60 Incorrect 0 ms 348 KB Output isn't correct
61 Incorrect 0 ms 348 KB Output isn't correct
62 Incorrect 0 ms 348 KB Output isn't correct
63 Incorrect 0 ms 348 KB Output isn't correct
64 Incorrect 1 ms 348 KB Output isn't correct
65 Incorrect 0 ms 348 KB Output isn't correct
66 Incorrect 0 ms 348 KB Output isn't correct
67 Incorrect 1 ms 600 KB Output isn't correct
68 Incorrect 1 ms 344 KB Output isn't correct
69 Incorrect 0 ms 348 KB Output isn't correct
70 Incorrect 1 ms 348 KB Output isn't correct
71 Incorrect 0 ms 348 KB Output isn't correct
72 Incorrect 0 ms 348 KB Output isn't correct
73 Incorrect 0 ms 348 KB Output isn't correct
74 Incorrect 1 ms 348 KB Output isn't correct
75 Incorrect 0 ms 348 KB Output isn't correct
76 Incorrect 1 ms 348 KB Output isn't correct
77 Incorrect 1 ms 348 KB Output isn't correct
78 Incorrect 0 ms 348 KB Output isn't correct
79 Incorrect 0 ms 348 KB Output isn't correct
80 Incorrect 1 ms 344 KB Output isn't correct
81 Incorrect 0 ms 348 KB Output isn't correct
82 Incorrect 0 ms 348 KB Output isn't correct
83 Incorrect 0 ms 348 KB Output isn't correct
84 Incorrect 0 ms 348 KB Output isn't correct
85 Incorrect 1 ms 356 KB Output isn't correct
86 Incorrect 0 ms 348 KB Output isn't correct
87 Incorrect 0 ms 348 KB Output isn't correct
88 Incorrect 0 ms 348 KB Output isn't correct
89 Incorrect 0 ms 348 KB Output isn't correct
90 Incorrect 0 ms 348 KB Output isn't correct
91 Incorrect 0 ms 348 KB Output isn't correct
92 Incorrect 1 ms 348 KB Output isn't correct
93 Incorrect 0 ms 348 KB Output isn't correct
94 Incorrect 1 ms 600 KB Output isn't correct
95 Incorrect 0 ms 348 KB Output isn't correct
96 Incorrect 0 ms 348 KB Output isn't correct
97 Incorrect 0 ms 344 KB Output isn't correct
98 Incorrect 1 ms 348 KB Output isn't correct
99 Incorrect 0 ms 348 KB Output isn't correct
100 Incorrect 0 ms 348 KB Output isn't correct