제출 #1281341

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1281341		trinm01	Selling RNA Strands (JOI16_selling_rna)	C++20	100 / 100	581 ms	777040 KiB

selling_rna

// #pragma GCC optimize("O3")
// #pragma GCC optimization("Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;

#define int long long 
#define ll long long
#define FOR(i, l, r) for (int i = (l); i <= (r); i++)
#define FOD(i, r, l) for (int i = (r); i >= (l); i--)
#define fi first
#define se second
#define pii pair<int, int>

const ll mod = 1e9 + 7;
const int MAXN = 2e6 + 5;
const ll oo = 1e18 + 7;  
const int base = 10;

int n, q;
string a[MAXN];
struct query{
	string a, b;
	int id;
}tv[MAXN];
bool cmp(query a, query b){
	return a.a<b.a;
}
int res[MAXN];

int child[MAXN][30], dm;
vector<int> cnt[MAXN];
void add(string &s, int id){
	int u=0;
	FOD(i, (int)s.size()-1, 0){
		int k=s[i]-'A'+1;
		if(!child[u][k]){
			child[u][k]=++dm;
		}
		u=child[u][k];
		cnt[u].push_back(id);
	}
}
int get(string &s, int l, int r){
	int u=0;
	FOD(i, (int)s.size()-1, 0){
		int k=s[i]-'A'+1;
		if(!child[u][k]){
			return 0;
		}
		u=child[u][k];
	}
	// for(auto x:cnt[u]){
		// cout << x << ' ';
	// }
	// cout << '\n';
	int it1=lower_bound(cnt[u].begin(), cnt[u].end(), l)-cnt[u].begin()+1;
	int it2=upper_bound(cnt[u].begin(), cnt[u].end(), r)-cnt[u].begin()+1-1;
	// cout << l << ' ' << r << '\n';
	return it2-it1+1;
}

int check(string &a, string &b){
	// if((int)a.size()<(int)b.size()) return 0;
	FOR(i, 0, (int)b.size()-1){
		if(a[i]<b[i]){
			return 0;
		}
		if(a[i]>b[i]){
			return 2;
		}
	}
	return 1;
}



signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    
    // freopen("test.txt", "r", stdin);
    // freopen("o2.out", "w", stdout);

    if(fopen(".inp", "r")){
        freopen(".inp", "r", stdin);
        freopen(".out", "w", stdout);
    }

    cin >> n >> q;
    FOR(i, 1, n){
    	cin >> a[i];
    }
    FOR(i, 1, q){
    	cin >> tv[i].a >> tv[i].b;
    	tv[i].id=i;
    }
    sort(a+1, a+1+n);
    sort(tv+1, tv+1+q, cmp);
    
    // FOR(i, 1, n){
    	// cout << a[i] << '\n';
    // }
    // cout << '\n';
    // FOR(i, 1, q){
    	// cout << tv[i].a << '\n';
    // }
    
    FOR(i, 1, n){
    	add(a[i], i);
    }
    
    FOR(i, 1, q){
    	auto [s, ss, id]=tv[i];
    	// cout << i << ' ' << j-1 << '\n';
    	int l=1, r=n, pos2=n+1;
    	while(l<=r){
    		int mid=(l+r)/2;
    		if(check(a[mid], s)==2){
    			pos2=mid;
    			r=mid-1;
    		}
    		else{
    			l=mid+1;
    		}
    	}
    	l=1, r=n;
    	int pos1=0;
    	while(l<=r){
    		int mid=(l+r)/2;
    		if(check(a[mid], s)==0){
    			pos1=mid;
    			l=mid+1;
    		}
    		else{
    			r=mid-1;
    		}
    	}
    	// cout << pos1+1 << ' ' << pos2-1 << '\n';
    	res[id]=get(ss, pos1+1, pos2-1);
    }
    FOR(i, 1, q){
    	cout << res[i] << '\n';
    }
    
    return 0;
}

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

selling_rna.cpp: In function 'int main()':
selling_rna.cpp:88:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |         freopen(".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~
selling_rna.cpp:89:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |         freopen(".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 25 / 25
• Subtask 3: 25 / 25
• Subtask 4: 40 / 40