提出 #577281


ソースコード 拡げる

#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>          //cout<<fixed<<setprecision(10);
//#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
//#include <memory.h>
#include <cassert>

#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y), &(Z))
#define DRI(X) int (X); scanf("%d", &X)
#define DRII(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define DRIII(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define RS(X) scanf("%s", (X))
#define CASET int ___T, case_n = 1; scanf("%d ", &___T); while (___T-- > 0)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) ((int)strlen(X))
#define F first
#define S second
#define IOS ios_base::sync_with_stdio(0)
#ifdef ONLINE_JUDGE
#define FILEIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#else
#define FILEIO(name)
#endif

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef pair<ll,ll> pll;
/*#include<complex>
typedef complex<double> cd;
#define X real()
#define Y imag()*/

int a[1010],b[1010];
vector<ii> v;

int main()
{
    DRI(n);
    char s[4];
    REP(i,0,n){
        RS(s);
        RI(b[i]);
        if(s[0]=='y'){
            a[i]=1;
            v.PB(ii(b[i],i));
        }
        else a[i]=0;
    }
    sort(ALL(v));
    int ans=0;
    REP(i,0,SZ(v)){
        if(a[v[i].S]==-1)continue;
        int X=v[i].F-1;
        a[v[i].S]=-1;
        for(int j=v[i].S-1;j>=0;j--){
            if(a[j]==0&&b[j]>X)break;
            if(a[j]==1&&b[j]>X)a[j]=-1;
            //cout<<j<<endl;
        }
        REP(j,v[i].S+1,n){
            if(a[j]==0&&b[j]>X)break;
            if(a[j]==1&&b[j]>X)a[j]=-1;
            //cout<<j<<endl;
        }
        ans++;
    }
    cout<<ans<<endl;
    return 0;
}

提出情報

提出日時
問題 C - Delete Files
ユーザ HDYTTO
言語 C++11 (GCC 4.8.1)
得点 100
コード長 2382 Byte
結果 AC
実行時間 29 ms
メモリ 1052 KiB

コンパイルエラー

./Main.cpp: In function ‘int main()’:
./Main.cpp:67:11: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     DRI(n);
           ^
./Main.cpp:70:14: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         RS(s);
              ^
./Main.cpp:71:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         RI(b[i]);
                 ^

ジャッジ結果

セット名 All
得点 / 配点 100 / 100
結果
AC × 54
セット名 テストケース
All 00_sample_00, 00_sample_01, 00_sample_02, 01_random-small_00, 01_random-small_01, 01_random-small_02, 01_random-small_03, 01_random-small_04, 01_random-small_05, 01_random-small_06, 01_random-small_07, 01_random-small_08, 01_random-small_09, 02_random-large_00, 02_random-large_01, 02_random-large_02, 02_random-large_03, 02_random-large_04, 02_random-large_05, 02_random-large_06, 02_random-large_07, 02_random-large_08, 02_random-large_09, 03_mutual_00, 03_mutual_01, 03_mutual_02, 03_mutual_03, 03_mutual_04, 03_mutual_05, 03_mutual_06, 03_mutual_07, 03_mutual_08, 03_mutual_09, 04_all_00, 04_all_01, 04_all_02, 04_all_03, 04_all_04, 04_all_05, 04_all_06, 04_all_07, 04_all_08, 04_all_09, 05_maximal_00, 05_maximal_01, 05_maximal_02, 05_maximal_03, 05_maximal_04, 05_maximal_05, 05_maximal_06, 05_maximal_07, 05_maximal_08, 05_maximal_09, 99_handmade_00
ケース名 結果 実行時間 メモリ
00_sample_00 AC 25 ms 1048 KiB
00_sample_01 AC 27 ms 988 KiB
00_sample_02 AC 27 ms 1052 KiB
01_random-small_00 AC 25 ms 1048 KiB
01_random-small_01 AC 27 ms 1048 KiB
01_random-small_02 AC 26 ms 1044 KiB
01_random-small_03 AC 25 ms 1044 KiB
01_random-small_04 AC 24 ms 1048 KiB
01_random-small_05 AC 26 ms 1044 KiB
01_random-small_06 AC 26 ms 1048 KiB
01_random-small_07 AC 26 ms 1044 KiB
01_random-small_08 AC 26 ms 932 KiB
01_random-small_09 AC 29 ms 1044 KiB
02_random-large_00 AC 28 ms 940 KiB
02_random-large_01 AC 26 ms 1048 KiB
02_random-large_02 AC 27 ms 1044 KiB
02_random-large_03 AC 27 ms 1048 KiB
02_random-large_04 AC 26 ms 936 KiB
02_random-large_05 AC 27 ms 1052 KiB
02_random-large_06 AC 27 ms 1052 KiB
02_random-large_07 AC 29 ms 1044 KiB
02_random-large_08 AC 26 ms 956 KiB
02_random-large_09 AC 28 ms 1044 KiB
03_mutual_00 AC 25 ms 1040 KiB
03_mutual_01 AC 26 ms 1044 KiB
03_mutual_02 AC 26 ms 1052 KiB
03_mutual_03 AC 26 ms 1048 KiB
03_mutual_04 AC 26 ms 1048 KiB
03_mutual_05 AC 26 ms 1044 KiB
03_mutual_06 AC 26 ms 1044 KiB
03_mutual_07 AC 27 ms 1048 KiB
03_mutual_08 AC 26 ms 1044 KiB
03_mutual_09 AC 26 ms 1044 KiB
04_all_00 AC 26 ms 1048 KiB
04_all_01 AC 26 ms 1044 KiB
04_all_02 AC 25 ms 1048 KiB
04_all_03 AC 25 ms 1048 KiB
04_all_04 AC 24 ms 1048 KiB
04_all_05 AC 26 ms 1052 KiB
04_all_06 AC 26 ms 1052 KiB
04_all_07 AC 26 ms 1044 KiB
04_all_08 AC 29 ms 1040 KiB
04_all_09 AC 27 ms 1048 KiB
05_maximal_00 AC 28 ms 996 KiB
05_maximal_01 AC 25 ms 1048 KiB
05_maximal_02 AC 26 ms 1040 KiB
05_maximal_03 AC 27 ms 1044 KiB
05_maximal_04 AC 26 ms 996 KiB
05_maximal_05 AC 26 ms 1048 KiB
05_maximal_06 AC 26 ms 1044 KiB
05_maximal_07 AC 26 ms 1048 KiB
05_maximal_08 AC 26 ms 1040 KiB
05_maximal_09 AC 27 ms 1048 KiB
99_handmade_00 AC 24 ms 1048 KiB